Beautiful Arrangement LeetCode solution in JavaScript

1
var countArrangement = function (n) {
2
  let result = 0;
3
  const visited = Array(n + 1).fill(false);
4
  const dfs = (next = n) => {
5
    if (next === 0) {
6
      result += 1;
7
      return;
8
    }
9

10
    for (let index = 1; index <= n; index++) {
11
      if (visited[index] || (index % next && next % index)) continue;
12
      visited[index] = true;
13
      dfs(next - 1);
14
      visited[index] = false;
15
    }
16
  };
17

18
  dfs();
19
  return result;
20
};