algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: typo

Browse Source
This commit is contained in:
kyshen
2024-08-21 23:35:24 +08:00
parent 488f040745
commit 1a9fdd3eb0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/kamacoder/0047.参会dijkstra朴素.md
View File

@ -150,7 +150,7 @@ minDist数组数值初始化为int最大值。
更新 minDist数组，即：源点（节点1） 到 节点2 和 节点3的距离。
* 源点到节点2的最短距离为1，小于原minDist[2]的数值max，更新minDist[2] = 1
* 源点到节点3的最短距离为4，小于原minDist[3]的数值max，更新minDist[4] = 4
* 源点到节点3的最短距离为4，小于原minDist[3]的数值max，更新minDist[3] = 4
可能有录友问：为啥和 minDist[2] 比较？