Maximum Length of Repeated Subarray LeetCode solution in JavaScript

1
var findLength = function (nums1, nums2) {
2
  let dp = new Array(nums1.length + 1)
3
    .fill(0)
4
    .map(() => new Array(nums2.length + 1).fill(0));
5
  let max = 0;
6
  for (let i = 0; i < nums1.length; i++) {
7
    for (let j = 0; j < nums2.length; j++) {
8
      if (nums1[i] != nums2[j]) {
9
        continue;
10
      }
11
      dp[i + 1][j + 1] = dp[i][j] + 1;
12
      max = Math.max(max, dp[i + 1][j + 1]);
13
    }
14
  }
15

16
  return max;
17
};