add 2134

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2134|[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2134.java) ||Medium||
 |2133|[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) ||Easy||
 |2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) ||Medium||
 |2129|[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2129.java) ||Easy||

src/main/java/com/fishercoder/solutions/_2134.java

@@ -0,0 +1,44 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2134 {
+    public static class Solution1 {
+        /**
+         * Connect the original array with itself to simulate the circular property of this array.
+         * Then use a sliding window to find the minimum swaps.
+         */
+        public int minSwaps(int[] nums) {
+            int ones = 0;
+            List<Integer> list = new ArrayList<>();
+            for (int num : nums) {
+                ones += num;
+                list.add(num);
+            }
+            for (int num : nums) {
+                list.add(num);
+            }
+            int minSwaps = nums.length;
+            int zeroes = 0;
+            for (int left = 0, right = 0; right < list.size(); right++) {
+                if (list.get(right) == 0) {
+                    zeroes++;
+                }
+                int len = right - left + 1;
+                if (len < ones) {
+                    continue;
+                } else if (len == ones) {
+                    minSwaps = Math.min(minSwaps, zeroes);
+                } else {
+                    if (list.get(left) == 0) {
+                        zeroes--;
+                    }
+                    left++;
+                    minSwaps = Math.min(minSwaps, zeroes);
+                }
+            }
+            return minSwaps;
+        }
+    }
+}

src/test/java/com/fishercoder/_2134Test.java

@@ -0,0 +1,36 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2134;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2134Test {
+    private static _2134.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2134.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{0, 1, 0, 1, 1, 0, 0};
+        assertEquals(1, solution1.minSwaps(nums));
+    }
+
+    @Test
+    public void test2() {
+        nums = new int[]{0, 1, 1, 1, 0, 0, 1, 1, 0};
+        assertEquals(2, solution1.minSwaps(nums));
+    }
+
+    @Test
+    public void test3() {
+        nums = new int[]{1, 1, 0, 0, 1};
+        assertEquals(0, solution1.minSwaps(nums));
+    }
+
+}