LeetCode 每日一题 1035.不相交的线

---

问题描述

简要思路

DP

代码

class Solution {
public:
    int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
        int dp[501][501]{0};
        int n = nums1.size();
        int m = nums2.size();
        int res = 0;

        for(int i = n-1; i >= 0; i--){
            for(int j = m-1; j >= 0; j--){
                if(nums1[i] == nums2[j]){
                    dp[i][j] = 1 + dp[i+1][j+1];
                }
                else {
                    dp[i][j] = max(dp[i+1][j], dp[i][j+1]);
                }
                dp[i][j] = max(dp[i][j], dp[i][j+1]);
                res = max(res, dp[i][j]);
            }
        }

        return res;
    }
};