Package g1501_1600.s1514_path_with_maximum_probability

Class Solution

java.lang.Object

g1501_1600.s1514_path_with_maximum_probability.Solution

public class Solution
extends Object

1514 - Path with Maximum Probability.<p>Medium</p> <p>You are given an undirected weighted graph of <code>n</code> nodes (0-indexed), represented by an edge list where <code>edges[i] = [a, b]</code> is an undirected edge connecting the nodes <code>a</code> and <code>b</code> with a probability of success of traversing that edge <code>succProb[i]</code>.</p> <p>Given two nodes <code>start</code> and <code>end</code>, find the path with the maximum probability of success to go from <code>start</code> to <code>end</code> and return its success probability.</p> <p>If there is no path from <code>start</code> to <code>end</code>, <strong>return 0</strong>. Your answer will be accepted if it differs from the correct answer by at most <strong>1e-5</strong>.</p> <p><strong>Example 1:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/09/20/1558_ex1.png" alt="" /></strong></p> <p><strong>Input:</strong> n = 3, edges = [[0,1],[1,2],[0,2]], succProb = [0.5,0.5,0.2], start = 0, end = 2</p> <p><strong>Output:</strong> 0.25000</p> <p><strong>Explanation:</strong> There are two paths from start to end, one having a probability of success = 0.2 and the other has 0.5 * 0.5 = 0.25.</p> <p><strong>Example 2:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/09/20/1558_ex2.png" alt="" /></strong></p> <p><strong>Input:</strong> n = 3, edges = [[0,1],[1,2],[0,2]], succProb = [0.5,0.5,0.3], start = 0, end = 2</p> <p><strong>Output:</strong> 0.30000</p> <p><strong>Example 3:</strong></p> <p><strong><img src="https://assets.leetcode.com/uploads/2019/09/20/1558_ex3.png" alt="" /></strong></p> <p><strong>Input:</strong> n = 3, edges = [[0,1]], succProb = [0.5], start = 0, end = 2</p> <p><strong>Output:</strong> 0.00000</p> <p><strong>Explanation:</strong> There is no path between 0 and 2.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= n <= 10^4</code></li> <li><code>0 <= start, end < n</code></li> <li><code>start != end</code></li> <li><code>0 <= a, b < n</code></li> <li><code>a != b</code></li> <li><code>0 <= succProb.length == edges.length <= 2*10^4</code></li> <li><code>0 <= succProb[i] <= 1</code></li> <li>There is at most one edge between every two nodes.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
double	maxProbability(int n, int[][] edges, double[] succProb, int start, int end)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maxProbability

public double maxProbability(int n,
 int[][] edges,
 double[] succProb,
 int start,
 int end)