Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 7683e17

Browse files
1143.最长公共子序列文字勘误
1 parent 371cfe1 commit 7683e17

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎problems/1143.最长公共子序列.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -80,7 +80,7 @@ if (text1[i - 1] == text2[j - 1]) {
8080

8181
先看看dp[i][0]应该是多少呢?
8282

83-
test1[0, i-1]和空串的最长公共子序列自然是0,所以dp[i][0] = 0;
83+
text1[0, i-1]和空串的最长公共子序列自然是0,所以dp[i][0] = 0;
8484

8585
同理dp[0][j]也是0。
8686

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /