代码随想录：最长重复子数组

dp数组的含义是当前数字结尾的最大重复子数组

class Solution {
public:
    int findLength(vector<int>& nums1, vector<int>& nums2) {
        int res = 0;

        vector<vector<int>> dp =
            vector<vector<int>>(nums1.size(), vector<int>(nums2.size(), 0));
        for (int i = 0; i < nums1.size(); i++) {
            if (nums2[0] == nums1[i]) {
                dp[i][0] = 1;
                res = 1;
            }
        }
        for (int j = 0; j < nums2.size(); j++) {
            if (nums1[0] == nums2[j]) {
                dp[0][j] = 1;
                res = 1;
            }
        }

        for (int i = 1; i < nums1.size(); i++) {
            for (int j = 1; j < nums2.size(); j++) {
                if (nums1[i] == nums2[j])
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                res = max(res, dp[i][j]);
            }
        }
        return res;
    }
};