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 #519

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
pull merged 10 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Jan 3, 2025
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
优化表达
  • Loading branch information
youngyangyang04 committed Dec 11, 2024
commit e7f96785d45c8858e68df5cae3851a7738a25635
3 changes: 2 additions & 1 deletion problems/kamacoder/0097.小明逛公园.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -100,7 +100,8 @@ Floyd算法核心思想是动态规划。

这里我们用 grid数组来存图,那就把dp数组命名为 grid。

grid[i][j][k] = m,表示 节点i 到 节点j 以[1...k] 集合为中间节点的最短距离为m。
grid[i][j][k] = m,表示 **节点i 到 节点j 以[1...k] 集合中的一个节点为中间节点的最短距离为m**。


可能有录友会想,凭什么就这么定义呢?

Expand Down

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