Concise Java Code (DP)


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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.