algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

1143.最长公共子序列文字勘误

Browse Source
This commit is contained in:
markwang
2024-10-17 13:28:39 +08:00
parent 371cfe182a
commit 7683e17338
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/1143.最长公共子序列.md
View File

@ -80,7 +80,7 @@ if (text1[i - 1] == text2[j - 1]) {
先看看dp[i][0]应该是多少呢？
test1[0, i-1]和空串的最长公共子序列自然是0，所以dp[i][0] = 0;
text1[0, i-1]和空串的最长公共子序列自然是0，所以dp[i][0] = 0;
同理dp[0][j]也是0。