Commit e7f9678

committed

优化表达

1 parent ac6dfbc commit e7f9678Copy full SHA for e7f9678

File tree

-1

lines changed

-1

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -100,7 +100,8 @@ Floyd算法核心思想是动态规划。`
`100`	`100`
`101`	`101`	`这里我们用 grid数组来存图,那就把dp数组命名为 grid。`
`102`	`102`
`103`		`-grid[i][j][k] = m,表示节点i 到节点j 以[1...k] 集合为中间节点的最短距离为m。`
	`103`	`+grid[i][j][k] = m,表示节点i 到节点j 以[1...k] 集合中的一个节点为中间节点的最短距离为m。`
	`104`	`+`
`104`	`105`
`105`	`106`	`可能有录友会想,凭什么就这么定义呢?`
`106`	`107`

Comments

(0)