Runtime: 82 ms (Top 52.25%) | Memory: 75.8 MB (Top 66.61%)

AnasImloul · AnasImloul · commit c2b31920f1e6 · 2022-08-24T14:31:10.000+01:00
diff --git a/scripts/algorithms/P/Path with Maximum Probability/Path with Maximum Probability.java b/scripts/algorithms/P/Path with Maximum Probability/Path with Maximum Probability.java
@@ -1,3 +1,4 @@
+// Runtime: 82 ms (Top 52.25%) | Memory: 75.8 MB (Top 66.61%)
 class Pair{
     int to;
     double prob;
@@ -28,7 +29,7 @@ public double maxProbability(int n, int[][] edges, double[] succProb, int start,
                 if(((curr.prob)*(x.prob))>probs[x.to]){
                     probs[x.to]=((curr.prob)*(x.prob));
                     pq.offer(new Pair(x.to,probs[x.to]));
-                    
+
                 }
                 else{
                     continue;
@@ -37,4 +38,4 @@ public double maxProbability(int n, int[][] edges, double[] succProb, int start,
         }
         return probs[end];
     }
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+// Runtime: 82 ms (Top 52.25%) \| Memory: 75.8 MB (Top 66.61%)`
`1`	`2`	`class Pair{`
`2`	`3`	`int to;`
`3`	`4`	`double prob;`
`@@ -28,7 +29,7 @@ public double maxProbability(int n, int[][] edges, double[] succProb, int start,`
`28`	`29`	`if(((curr.prob)*(x.prob))>probs[x.to]){`
`29`	`30`	`probs[x.to]=((curr.prob)*(x.prob));`
`30`	`31`	`pq.offer(new Pair(x.to,probs[x.to]));`
`31`		`-`
	`32`	`+`
`32`	`33`	`}`
`33`	`34`	`else{`
`34`	`35`	`continue;`
`@@ -37,4 +38,4 @@ public double maxProbability(int n, int[][] edges, double[] succProb, int start,`
`37`	`38`	`}`
`38`	`39`	`return probs[end];`
`39`	`40`	`}`
`40`		`-}`
	`41`	`+}`