package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
# README
1514. Path with Maximum Probability
Solution idea
Dijkstra
要点总结
- 比较常规的Dijkstra找最短路径的题目, 唯一的变化是: 求"最大概率"的路径 - 也就是，1. 路径的值变成weight相乘; 2. 用 maxHeap 挑选 "最大概率"
Time complexity = $O(E\log E)$