1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| class Solution {
public:
int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
const int m = nums1.size(), n = nums2.size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1));
for (int i = 1; i <= m; ++i) {
int num1 = nums1[i - 1];
for (int j = 1; j <= n; ++j) {
int num2 = nums2[j - 1];
if (num1 == num2)
dp[i][j] = dp[i - 1][j - 1] + 1;
else
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
return dp[m][n];
}
};
|