视频讲解：

https://www.bilibili.com/video/BV1Es4y1N7v1/?spm_id_from=333.999.0.0&vd_source=84c3c489cf545fafdbeb3b3a6cd6a112

Dijkstra and Floyd

Dijkstra 是贪心的算法， 它利用了边权非负的性质。

Q1 https://leetcode.cn/problems/find-the-width-of-columns-of-a-grid/solution/jian-ji-xie-fa-by-endlesscheng-xudg/ Q2 https://leetcode.cn/problems/find-the-score-of-all-prefixes-of-an-array/solution/yi-bian-bian-li-yi-bian-ji-suan-by-endle-ep7x/ Q3 https://leetcode.cn/problems/cousins-in-binary-tree-ii/solution/bfssuan-liang-ci-pythonjavacgo-by-endles-b72a/ Q4 https://leetcode.cn/problems/design-graph-with-shortest-path-calculator/solution/dijkstra-suan-fa-mo-ban-pythonjavacgo-by-unmv/