Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

[pull] master from youngyangyang04:master #481

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
jenningsloy318 merged 6 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Sep 2, 2024
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
fix: typo
  • Loading branch information
sunlight0602 committed Aug 21, 2024
commit 1a9fdd3eb0f904c058b4b6e994359d30e70b4170
2 changes: 1 addition & 1 deletion problems/kamacoder/0047.参会dijkstra朴素.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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] 比较?

Expand Down

AltStyle によって変換されたページ (->オリジナル) /