Count the Number of Ideal Arrays LeetCode solution in JavaScript

1
/**
2
 * @param {number} n
3
 * @param {number} maxValue
4
 * @return {number}
5
 */
6
var idealArrays = function (n, maxValue) {
7
  const mod = 1e9 + 7;
8
  let cur = 0;
9
  let arr = Array(2)
10
    .fill()
11
    .map(() => Array(maxValue).fill(1));
12
  for (let l = 2; l <= n; l++) {
13
    const prev = arr[cur];
14
    const next = arr[1 - cur];
15
    for (let s = 1; s <= maxValue; s++) {
16
      let res = 0;
17
      for (let m = 1; m * s <= maxValue; m++) {
18
        res = (res + prev[m * s - 1]) % mod;
19
      }
20
      next[s - 1] = res;
21
    }
22
    cur = 1 - cur;
23
  }
24
  const res = arr[cur].reduce((a, b) => (a + b) % mod, 0);
25
  return res;
26
};