# 718.最长重复子数组

## 问题描述
[718.最长重复子数组](https://leetcode.cn/problems/maximum-length-of-repeated-subarray/)

## 解题思路
`dp[i][j]`表示分别以`nums1[i - 1]`, `nums2[j - 1]`结尾的两个子数组的最长公共子数组的长度；

递推关系:
```cpp
if (nums1[i - 1] == nums2[j - 1])
    dp[i][j] = dp[i - 1][j - 1] + 1;
```

## 代码
```cpp
class Solution {
  public:
    int findLength(vector<int> &nums1, vector<int> &nums2) {
        vector<vector<int>> dp(nums1.size() + 1, vector<int>(nums2.size() + 1, 0));
        int m = 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] = max(dp[i - 1][j - 1] + 1, dp[i][j]);
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                if (dp[i][j] > m)
                    m = dp[i][j];
            }
        }
        return m;
    }
};
```