718. Maximum Length of Repeated Subarray

原网址为https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/

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

代码：

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