add 1151

fishercoder1534 · fishercoder1534 · commit 5a98d2c75b75 · 2021-11-04T07:47:42.000-07:00
diff --git a/README.md b/README.md
@@ -407,6 +407,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java)| |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | |Easy||
 |1152|[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1152.java) |[:tv:](https://youtu.be/V510Lbtrm5s) |Medium|HashTable, Sort, Array|
+|1151|[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1151.java) ||Medium|Array, Sliding Window|
 |1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java)|[:tv:](https://youtu.be/-t2cdVs9cKk) |Easy||
 |1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/)|[Javascript](./javascript/_1146.js)| | Easy ||
 |1143|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1143.java) | |Medium||String, DP
diff --git a/src/main/java/com/fishercoder/solutions/_1151.java b/src/main/java/com/fishercoder/solutions/_1151.java
@@ -0,0 +1,44 @@
+package com.fishercoder.solutions;
+
+public class _1151 {
+    public static class Solution1 {
+        /**
+         * My completely original solution on 11/4/2021.
+         * Typical sliding window problem/solution
+         */
+        public int minSwaps(int[] data) {
+            int oneCount = 0;
+            for (int d : data) {
+                if (d == 1) {
+                    oneCount++;
+                }
+            }
+            if (oneCount <= 1) {
+                return 0;
+            }
+            int left = 0;
+            int right = 0;
+            int ones = 0;
+            int zeroes = 0;
+            int minSwaps = data.length;
+            while (right < data.length) {
+                if (data[right] == 1) {
+                    ones++;
+                } else {
+                    zeroes++;
+                }
+                if (ones + zeroes == oneCount) {
+                    minSwaps = Math.min(minSwaps, zeroes);
+                    if (data[left] == 1) {
+                        ones--;
+                    } else {
+                        zeroes--;
+                    }
+                    left++;
+                }
+                right++;
+            }
+            return minSwaps;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1151Test.java b/src/test/java/com/fishercoder/_1151Test.java
@@ -0,0 +1,54 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1151;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1151Test {
+    private static _1151.Solution1 solution1;
+    private static int[] data;
+    private static int expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1151.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        data = new int[]{1, 0, 1, 0, 1};
+        expected = 1;
+        assertEquals(expected, solution1.minSwaps(data));
+    }
+
+    @Test
+    public void test2() {
+        data = new int[]{0, 0, 0, 1, 0};
+        expected = 0;
+        assertEquals(expected, solution1.minSwaps(data));
+    }
+
+    @Test
+    public void test3() {
+        data = new int[]{1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1};
+        expected = 3;
+        assertEquals(expected, solution1.minSwaps(data));
+    }
+
+    @Test
+    public void test4() {
+        data = new int[]{1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1};
+        expected = 8;
+        assertEquals(expected, solution1.minSwaps(data));
+    }
+
+    @Test
+    public void test5() {
+        data = new int[]{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
+        expected = 0;
+        assertEquals(expected, solution1.minSwaps(data));
+    }
+
+}
