Minimum Number of Operations to Reinitialize a Permutation LeetCode solution in Java

1
class Solution {
2
  public int reinitializePermutation(int n) {
3
    int ans = 1;
4
    int num = 2;
5
    if (n == 2) return 1;
6
    while (true) {
7
      if (num % (n - 1) == 1) break;
8
      else {
9
        ans++;
10
        num = (num * 2) % (n - 1);
11
      }
12
    }
13
    return ans;
14
  }
15
}