【leetcode】【medium】718. Maximum Length of Repeated Subarray​​​​​​​

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

题目链接：https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray/

 

思路

法一：dp

存储空间用于记录遍历到以当前两个串的值为尾时，最长子串的长度是读多少。状态转移方程是：

  

class Solution {
public:
    int findLength(vector<int>& A, vector<int>& B) {
        int lena = A.size(), lenb = B.size();
        if(lena==0 || lenb==0) return 0;
        int record[lena][lenb];
        int res = 0;
        for(int i=0; i<lena; ++i){
            for(int j=0;j<lenb; ++j){
                if(A[i]==B[j]){
                    record[i][j] = (i-1>=0 && j-1>=0)?record[i-1][j-1]+1: 1;
                    res = max(res, record[i][j]);
                }else{
                    record[i][j] = 0;
                }
            }
        }
        return res;
    }
};

法其他

看解析还有其他做法：

1.将优化问题转为决策问题，二分法查找能行通的子串长度。

2.哈希法，这个没太懂。

参考这个分享：https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray/solution/zui-chang-zhong-fu-zi-shu-zu-by-leetcode/