leetcode

0 class Solution {

1 public:

2 int reinitializePermutation(int n) {

3 int res = 0, i = 1;

4 while (res == 0 || i > 1) {

5 i = i * 2 % (n - 1);

6 res++;

7 }

8 return res;

9 }

10 };