Maximum Length of Repeated Subarray LeetCode solution in Java

1
class Solution {
2
  public int findLength(int[] nums1, int[] nums2) {
3
    int n = nums1.length, m = nums2.length;
4
    int[][] dp = new int[n + 1][m + 1];
5
    // for(int [] d: dp)Arrays.fill(d,-1);
6
    int ans = 0;
7
    for (int i = n - 1; i >= 0; i--) {
8
      for (int j = m - 1; j >= 0; j--) {
9
        if (nums1[i] == nums2[j]) {
10
          dp[i][j] = dp[i + 1][j + 1] + 1;
11
          if (ans < dp[i][j]) ans = dp[i][j];
12
        }
13
      }
14
    }
15
    return ans;
16
  }
17
}