class Solution {
public:
int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
/*
dp[i][j] : 在nums1[0 ~ i - 1],nums2[0 ~ j - 1]中选择,绘制线条的最大连线数
dp[i][j] =
if nums1[i - 1] = nums[j - 1] : dp[i][j] = dp[i - 1][j - 1] + 1
else dp[i][j] = max(dp[i][j - 1], dp[i - 1][j])
*/
vector<vector<int>> dp(nums1.size()+1, vector<int>(nums2.size()+1, 0));
for(int i = 1; i <= nums1.size(); i ++){
for(int j = 1; j <= nums2.size(); j ++){
if(nums1[i - 1] == nums2[j - 1]){
dp[i][j] = dp[i - 1][j - 1] + 1;
}
else{
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
}
}
return dp[nums1.size()][nums2.size()];
}
};