＜Talk is cheap, show me the code 23＞ LeetCode.718 最长重复子数组

class Solution {
public:
    int findLength(vector<int>& nums1, vector<int>& nums2) {
        /*
        dp[i][j] : nums1中以下标i - 1为结尾，nums2中以下标j - 1为结尾(nums1[i - 1] = nums2[j - 1])的子数组长度
        dp[i][j] = dp[i - 1][j - 1] + 1;
        */
        vector<vector<int>> dp(nums1.size() + 1,vector<int>(nums2.size() + 1, 0));
        int result = 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;
                }
                if(dp[i][j] > result) result = dp[i][j];
            }
        }
        return result;
    }
};