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

fix

Browse Source
This commit is contained in:
yqq
2021-09-27 18:52:44 +08:00
parent a35adcffbe
commit a3b5912c1a
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/1035.不相交的线.md
View File

@ -124,13 +124,13 @@ func maxUncrossedLines(A []int, B []int) int {
for i := 1; i <= len(A); i++ { for i := 1; i <= len(A); i++ {
for j := 1; j <= len(B); j++ { for j := 1; j <= len(B); j++ {
if (A[i - 1] == B[j - 1]) { if (A[i - 1] == B[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1; dp[i][j] = dp[i - 1][j - 1] + 1
} else { } else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]); dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
} }
} }
} }
return dp[m][n]; return dp[m][n]
} }