[Leetcode] 718. Maximum Length of Repeated Subarray 解题报告

题目：

Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.

Example 1:

Input:
A: [1,2,3,2,1]
B: [3,2,1,4,7]
Output: 3
Explanation: 
The repeated subarray with maximum length is [3, 2, 1].

Note:

1. 1 <= len(A), len(B) <= 1000
2. 0 <= A[i], B[i] < 100

思路：

我们定义dp[i][j]表示以A[i - 1]和B[j - 1]结尾的子串的最长公共子串的长度，则递推公式为：dp[i][j] = A[i - 1] == B[j - 1] ? dp[i - 1][j - 1] + 1 : 0。然后我们统计出所有dp[i][j]中的最大值即可。通过递推公式可以看到dp[i][j]只与dp[i - 1][j - 1]有关，所以其实还可以进一步将空间复杂度降低到O(m)或者O(n)，其中m和n分别是A和B的长度。算法的时间复杂度为O(mn)。

代码：

class Solution {
public:
    int findLength(vector<int>& A, vector<int>& B) {
        int len1 = A.size(), len2 = B.size();
        vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1, 0));
        int ret = 0;
        for (int i = 1; i <= len1; ++i) {
            for (int j = 1; j <= len2; ++j) {
                dp[i][j] = A[i - 1] == B[j - 1] ? dp[i - 1][j - 1] + 1 : 0;
                ret = max(ret, dp[i][j]);
            }
        }
        return ret;
    }
};