Quartz 4

Home

❯

Readwise

❯

Articles

❯

无需建图,直接朴素 Dijkstra 求最短路(PythonJavaC++Go)

无需建图,直接朴素 Dijkstra 求最短路(PythonJavaC++Go)

Nov 17, 20241 min read

  • articles

无需建图,直接朴素 Dijkstra 求最短路(Python/Java/C++/Go)

rw-book-cover

Metadata

  • Author: 力扣 LeetCode
  • Full Title: 无需建图,直接朴素 Dijkstra 求最短路(Python/Java/C++/Go)
  • Category: articles
  • URL: https://leetcode.cn/problems/minimum-cost-of-a-path-with-special-roads/solution/zhi-jie-qiu-zui-duan-lu-wu-xu-jian-tu-by-i8h7/

Highlights

  • long t = (long) target[0] << 32 | target[1]; (View Highlight)

Graph View

  • 无需建图,直接朴素 Dijkstra 求最短路(Python/Java/C++/Go)
  • Metadata
  • Highlights

Created with Quartz v4.5.0 © 2025

  • GitHub
  • Discord Community