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

优化表达

Browse Source
This commit is contained in:
programmercarl
2024-12-11 11:53:47 +08:00
parent ac6dfbcd20
commit e7f96785d4
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/kamacoder/0097.小明逛公园.md
View File

@ -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**。
可能有录友会想，凭什么就这么定义呢？