718. Maximum Length of Repeated Subarray​​​​​​​

718. Maximum Length of Repeated Subarray 

状态转移方程，a[i]=b[j],dp[i][j]=?

a[i]!=b[j],dp[i][j]=?

class Solution {
    public int findLength(int[] a, int[] b) {
        int m = a.length, n = b.length;
        if (m == 0 || n == 0) return 0;
        int[][] dp = new int[m + 1][n + 1];
        int max = 0;
        for (int i = 1;i<=m; i++)
            for (int j =1; j<=n; j++)
                max = Math.max(max, dp[i][j] = a[i-1] == b[j-1] ? 1 + dp[i-1][j-1] : 0);
        return max;        
    }
}