718. Maximum Length of Repeated Subarray

https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/

解题思路：
1.dp[i][j] = dp[i - 1][j - 1] + 1 if nums1[i] == nums[j] where dp[i][j] represents the maximum length at the end with index of i and j.

代码：
class Solution {
public int findLength(int[] A, int[] B) {

    int aLen = A.length;
    int bLen = B.length;
    int[][] dp = new int[aLen + 1][bLen + 1];
    int max = 0; 
    for(int i = 1 ; i <= aLen; i++){
        for(int j = 1 ; j <= bLen; j++){
            if(A[i - 1] == B[j - 1])
                dp[i][j] = dp[i - 1][j - 1] + 1;
            max = Math.max(max, dp[i][j]);
        }
    }
    return max;
}

}