package LeetCode.FiveHundredOneToOneThousand;
public class SevenHundredAndEighteen {
public int findLength(int[] a, int[] b) {
int len = b.length, high = a.length;
int ans = Integer.MIN_VALUE;
int dp[][] = new int[high + 1][len + 1];
for (int i = high - 1; i >= 0; i--){
for (int j = len - 1; j >= 0; j--){
dp[i][j] = a[i] == b[j] ? dp[i + 1][j + 1] + 1 : 0;
ans = Math.max(dp[i][j], ans);
}
}
return ans;
}
}
Processed:
0.012, SQL:
9
