Minimum Number of Operations to Reinitialize a Permutation.py

// Runtime: 341 ms (Top 53.7%) | Memory: 16.20 MB (Top 72.22%)

class Solution:
    def reinitializePermutation(self, n: int) -> int:
        ans = 0
        perm = list(range(n))
        while True: 
            ans += 1
            perm = [perm[n//2+(i-1)//2] if i&1 else perm[i//2] for i in range(n)]
            if all(perm[i] == i for i in range(n)): return ans