github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0072.编辑距离.md
View File

@@ -170,7 +170,7 @@ for (int j = 0; j <= word2.size(); j++) dp[0][j] = j;
可以看出dp[i][j]是依赖左方，上方和左上方元素的，如图：
![72.编辑距离](https://code-thinking-1253855093.file.myqcloud.com/pics/20210114162113131.jpg)
![72.编辑距离](https://file.kamacoder.com/pics/20210114162113131.jpg)
所以在dp矩阵中一定是从左到右从上到下去遍历。
@@ -194,7 +194,7 @@ for (int i = 1; i <= word1.size(); i++) {
以示例1为例，输入：`word1 = "horse", word2 = "ros"`为例，dp矩阵状态图如下：
![72.编辑距离1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210114162132300.jpg)
![72.编辑距离1](https://file.kamacoder.com/pics/20210114162132300.jpg)
以上动规五部分析完毕，C++代码如下：