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/1143.最长公共子序列.md
View File

@@ -94,7 +94,7 @@ vector<vector<int>> dp(text1.size() + 1, vector<int>(text2.size() + 1, 0));
从递推公式，可以看出，有三个方向可以推出dp[i][j]，如图：
![1143.最长公共子序列](https://code-thinking-1253855093.file.myqcloud.com/pics/20210204115139616.jpg)
![1143.最长公共子序列](https://file.kamacoder.com/pics/20210204115139616.jpg)
那么为了在递推的过程中，这三个方向都是经过计算的数值，所以要从前向后，从上到下来遍历这个矩阵。
@@ -103,7 +103,7 @@ vector<vector<int>> dp(text1.size() + 1, vector<int>(text2.size() + 1, 0));
以输入：text1 = "abcde", text2 = "ace" 为例，dp状态如图：
![1143.最长公共子序列1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210210150215918.jpg)
![1143.最长公共子序列1](https://file.kamacoder.com/pics/20210210150215918.jpg)
最后红框dp[text1.size()][text2.size()]为最终结果