_1806.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Arrays;

publicclass_1806 {
publicstaticclassSolution1 {
publicintreinitializePermutation(intn) {
int[] initial = newint[n];
int[] perm = newint[n];
for (inti = 0; i < n; i++) {
initial[i] = i;
perm[i] = i;
 }
int[] arr = newint[n];
inttimes = 0;
do {
for (inti = 0; i < n; i++) {
if (i % 2 == 0) {
arr[i] = perm[i / 2];
 } else {
arr[i] = perm[n / 2 + (i - 1) / 2];
 }
 }
times++;
for (inti = 0; i < n; i++) {
perm[i] = arr[i];
 }
 } while (!Arrays.equals(arr, initial));
returntimes;
 }
 }
}