g1501_1600.s1514_path_with_maximum_probability.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g1501_1600.s1514_path_with_maximum_probability;

// #Medium #Heap_Priority_Queue #Graph #Shortest_Path
// #2022_04_09_Time_31_ms_(93.10%)_Space_51.7_MB_(98.80%)

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;

@SuppressWarnings("unchecked")
public class Solution {
    public double maxProbability(int n, int[][] edges, double[] succProb, int start, int end) {
        List[] nodeToNodesList = new List[n];
        List[] nodeToProbabilitiesList = new List[n];
        for (int i = 0; i < n; i++) {
            nodeToNodesList[i] = new ArrayList<>();
            nodeToProbabilitiesList[i] = new ArrayList<>();
        }
        for (int i = 0; i < edges.length; i++) {
            int u = edges[i][0];
            int v = edges[i][1];
            double w = succProb[i];
            nodeToNodesList[u].add(v);
            nodeToProbabilitiesList[u].add(w);
            nodeToNodesList[v].add(u);
            nodeToProbabilitiesList[v].add(w);
        }
        double[] probabilities = new double[n];
        probabilities[start] = 1.0;
        boolean[] visited = new boolean[n];
        Queue queue = new ArrayDeque<>();
        queue.add(start);
        visited[start] = true;
        while (!queue.isEmpty()) {
            int u = queue.poll();
            visited[u] = false;
            for (int i = 0; i < nodeToNodesList[u].size(); i++) {
                int v = nodeToNodesList[u].get(i);
                double w = nodeToProbabilitiesList[u].get(i);
                if (probabilities[u] * w > probabilities[v]) {
                    probabilities[v] = probabilities[u] * w;
                    if (!visited[v]) {
                        visited[v] = true;
                        queue.add(v);
                    }
                }
            }
        }
        return probabilities[end];
    }
}