Commit 029813a

committed

✨feat: Add 675

1 parent de424e4 commit 029813aCopy full SHA for 029813a

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -148,7 +148,7 @@ class Solution {`
`148`	`148`
`149`	`149`	`![image.png](https://pic.leetcode-cn.com/1653270722-gYnbgm-image.png)`
`150`	`150`
`151`		`-如何设计这样带有优先级的搜索顺序,则是 AStar 算法「启发式函数」的设计过程,其本质是对应了对「最小步数」的估算,只有当我们确保「最小步数估算 >= 实际最小步数」,AStar 算法的正确性才得以保证。`
	`151`	`+如何设计这样带有优先级的搜索顺序,则是 AStar 算法「启发式函数」的设计过程,其本质是对应了对「最小步数」的估算,只有当我们确保「最小步数估算 $\leq $ 实际最小步数」,AStar 算法的正确性才得以保证。`
`152`	`152`
`153`	`153`	`因此我们往往会直接使用「理论最小步数」来作为启发式函数的,对于本题,可直接使用「曼哈顿距离」作为「理论最小步数」。`
`154`	`154`

Comments

(0)