LeetCode718. 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] 和 B[j] 结尾的最长子串的长度，这样就能涵盖所有的情况，然后我们在这些情况中找出最大即可，状态转移方程为if (A[i] == B[j]) dp[i][j] = dp[i-1][j-1] + 1 else dp[i][j] = 0

c++代码：

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