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 <= len(A), len(B) <= 1000
0 <= A[i], B[i] < 100

思路

使用动态规划来解题。从大往小扫描 关系式是 if (A[i] == B[j]) { a[i][j] = a[i +1][j +1] + 1;}

代码

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