leetcode 718. 最长重复子数组

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