CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
youngyangyang04
2021-09-27 00:14:53 +08:00
parent 0f0bb6e741
commit 60097fe7bf
26 changed files with 120 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0583.两个字符串的删除操作.md
View File

@@ -52,7 +52,7 @@ dp[i][j]：以i-1为结尾的字符串word1，和以j-1位结尾的字符串word
从递推公式中，可以看出来，dp[i][0] 和 dp[0][j]是一定要初始化的。
dp[i][0]：word2为空字符串，以i-1为结尾的字符串word2要删除多少个元素，才能和word1相同呢，很明显dp[i][0] = i。
dp[i][0]：word2为空字符串，以i-1为结尾的字符串word1要删除多少个元素，才能和word2相同呢，很明显dp[i][0] = i。
dp[0][j]的话同理，所以代码如下：