feat: add solutions to lc problem: No.1758. Minimum Changes To Make Alternating Binary String

yanglbme · yanglbme · commit 4852b1c544c7 · 2021-06-07T19:01:19.000+08:00
diff --git a/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/README.md b/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/README.md
@@ -44,7 +44,6 @@
 	<li><code>s[i]</code> 是 <code>'0'</code> 或 <code>'1'</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -56,15 +55,43 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minOperations(self, s: str) -> int:
+        cnt = 0
+        for i, c in enumerate(s):
+            cnt += c == '01'[i & 1]
+        return min(cnt, len(s) - cnt)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minOperations(String s) {
+        int cnt = 0, n = s.length();
+        for (int i = 0; i < n; ++i) {
+            cnt += (s.charAt(i) == "01".charAt(i & 1) ? 1 : 0);
+        }
+        return Math.min(cnt, n - cnt);
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minOperations(string s) {
+        int cnt = 0, n = s.size();
+        for (int i = 0; i < n; ++i) {
+            cnt += s[i] == "01"[i & 1];
+        }
+        return min(cnt, n - cnt);
+    }
+};
 ```
 
 ### **...**
diff --git a/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/README_EN.md b/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/README_EN.md
@@ -51,13 +51,41 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minOperations(self, s: str) -> int:
+        cnt = 0
+        for i, c in enumerate(s):
+            cnt += c == '01'[i & 1]
+        return min(cnt, len(s) - cnt)
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minOperations(String s) {
+        int cnt = 0, n = s.length();
+        for (int i = 0; i < n; ++i) {
+            cnt += (s.charAt(i) == "01".charAt(i & 1) ? 1 : 0);
+        }
+        return Math.min(cnt, n - cnt);
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minOperations(string s) {
+        int cnt = 0, n = s.size();
+        for (int i = 0; i < n; ++i) {
+            cnt += s[i] == "01"[i & 1];
+        }
+        return min(cnt, n - cnt);
+    }
+};
 ```
 
 ### **...**
diff --git a/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/Solution.cpp b/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/Solution.cpp
@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int minOperations(string s) {
+        int cnt = 0, n = s.size();
+        for (int i = 0; i < n; ++i) {
+            cnt += s[i] == "01"[i & 1];
+        }
+        return min(cnt, n - cnt);
+    }
+};
diff --git a/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/Solution.java b/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/Solution.java
@@ -0,0 +1,9 @@
+class Solution {
+    public int minOperations(String s) {
+        int cnt = 0, n = s.length();
+        for (int i = 0; i < n; ++i) {
+            cnt += (s.charAt(i) == "01".charAt(i & 1) ? 1 : 0);
+        }
+        return Math.min(cnt, n - cnt);
+    }
+}
diff --git a/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/Solution.py b/solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/Solution.py
@@ -0,0 +1,6 @@
+class Solution:
+    def minOperations(self, s: str) -> int:
+        cnt = 0
+        for i, c in enumerate(s):
+            cnt += c == '01'[i & 1]
+        return min(cnt, len(s) - cnt)
