LeetCode: Minimum Number Of Operations To Reinitialize A Permutation Solution

1/**
2 * @param {number} n
3 * @return {number}
4 */
5var reinitializePermutation = function (n) {
6  let perm = Array.from({ length: n }, (_, i) => i)
7  const original = perm.join("")
8  let res = 0
9  while (true) {
10    res++
11    const arr = [...perm]
12    for (let i = 0; i < n; i++) {
13      if (i % 2 === 0) {
14        arr[i] = perm[i / 2]
15      } else {
16        arr[i] = perm[n / 2 + (i - 1) / 2]
17      }
18    }
19    perm = arr
20    if (perm.join("") === original) {
21      break
22    }
23  }
24  return res
25}