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/0718.最长重复子数组.md
View File

@@ -95,7 +95,7 @@ for (int i = 1; i <= nums1.size(); i++) {
拿示例1中，A: [1,2,3,2,1]，B: [3,2,1,4,7]为例，画一个dp数组的状态变化，如下：
![718.最长重复子数组](https://code-thinking-1253855093.file.myqcloud.com/pics/2021011215282060.jpg)
![718.最长重复子数组](https://file.kamacoder.com/pics/2021011215282060.jpg)
以上五部曲分析完毕，C++代码如下：
@@ -127,7 +127,7 @@ public:
在如下图中：
![718.最长重复子数组](https://code-thinking-1253855093.file.myqcloud.com/pics/2021011215282060-20230310134554486.jpg)
![718.最长重复子数组](https://file.kamacoder.com/pics/2021011215282060-20230310134554486.jpg)
我们可以看出dp[i][j]都是由dp[i - 1][j - 1]推出。那么压缩为一维数组，也就是dp[j]都是由dp[j - 1]推出。