add 1758

fishercoder1534 · fishercoder1534 · commit 1ec8ae55e9bd · 2021-02-14T09:37:01.000-08: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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1758|[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) ||Easy|Greedy, Array|
 |1754|[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) ||Medium|Greedy, Suffix Array|
 |1753|[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) ||Medium|Math, Heap|
 |1752|[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java) ||Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1758.java b/src/main/java/com/fishercoder/solutions/_1758.java
@@ -0,0 +1,40 @@
+package com.fishercoder.solutions;
+
+public class _1758 {
+    public static class Solution1 {
+        public int minOperations(String s) {
+            int ops1 = 0;
+            //start with 0
+            boolean isZero = true;
+            for (int i = 0; i < s.length(); i++) {
+                if (i % 2 == 0) {
+                    //should be zero, if not, change it to zero and increase ops1 by one
+                    if (s.charAt(i) != '0') {
+                        ops1++;
+                    }
+                } else {
+                    //should be one, if not, increase ops1 by one
+                    if (s.charAt(i) != '1') {
+                        ops1++;
+                    }
+                }
+            }
+
+            //start with 1
+            int ops2 = 0;
+            for (int i = 0; i < s.length(); i++) {
+                if (i % 2 == 0) {
+                    //should be one, if not, increase ops2 by one
+                    if (s.charAt(i) != '1') {
+                        ops2++;
+                    }
+                } else {
+                    if (s.charAt(i) != '0') {
+                        ops2++;
+                    }
+                }
+            }
+            return Math.min(ops1, ops2);
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1758Test.java b/src/test/java/com/fishercoder/_1758Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1758;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1758Test {
+    private static _1758.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1758.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.minOperations("0100"));
+    }
+
+}
