add 1806

fishercoder1534 · fishercoder1534 · commit 435aef335f0d · 2021-03-28T10:23:54.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1806|[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1806.java) ||Medium|Array, Greedy|
 |1805|[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1805.java) ||Medium|String|
 |1800|[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java) ||Easy|Two Pointers|
 |1797|[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java) ||Medium|HashTable, Design|
diff --git a/src/main/java/com/fishercoder/solutions/_1806.java b/src/main/java/com/fishercoder/solutions/_1806.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1806 {
+    public static class Solution1 {
+        public int reinitializePermutation(int n) {
+            int[] initial = new int[n];
+            int[] perm = new int[n];
+            for (int i = 0; i < n; i++) {
+                initial[i] = i;
+                perm[i] = i;
+            }
+            int[] arr = new int[n];
+            int times = 0;
+            do {
+                for (int i = 0; i < n; i++) {
+                    if (i % 2 == 0) {
+                        arr[i] = perm[i / 2];
+                    } else {
+                        arr[i] = perm[n / 2 + (i - 1) / 2];
+                    }
+                }
+                times++;
+                for (int i = 0; i < n; i++) {
+                    perm[i] = arr[i];
+                }
+            } while (!Arrays.equals(arr, initial));
+            return times;
+        }
+    }
+}
