feat: add solutions to lc problem: No.1963

No.1963.Minimum Number of Swaps to Make the String Balanced

Author: yanglbme

solution/1900-1999/1963.Minimum Number of Swaps to Make the String Balanced/README.md

@@ -73,15 +73,68 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minSwaps(self, s: str) -> int:
+        ans = 0
+        for c in s:
+            if c == '[':
+                ans += 1
+            elif ans:
+                ans -= 1
+        return (ans + 1) >> 1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minSwaps(String s) {
+        int ans = 0;
+        for (char c : s.toCharArray()) {
+            if (c == '[') {
+                ++ans;
+            } else if (ans > 0) {
+                --ans;
+            }
+        }
+        return (ans + 1) >> 1;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minSwaps(string s) {
+        int ans = 0;
+        for (char& c : s)
+        {
+            if (c == '[') ++ans;
+            else if (ans) --ans;
+        }
+        return (ans + 1) >> 1;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minSwaps(s string) int {
+	ans := 0
+	for _, c := range s {
+		if c == '[' {
+			ans++
+		} else if ans > 0 {
+			ans--
+		}
+	}
+	return (ans + 1) >> 1
+}
 ```
 
 ### **...**

solution/1900-1999/1963.Minimum Number of Swaps to Make the String Balanced/README_EN.md

@@ -65,13 +65,66 @@ The resulting string is "[[][]]".
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minSwaps(self, s: str) -> int:
+        ans = 0
+        for c in s:
+            if c == '[':
+                ans += 1
+            elif ans:
+                ans -= 1
+        return (ans + 1) >> 1
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minSwaps(String s) {
+        int ans = 0;
+        for (char c : s.toCharArray()) {
+            if (c == '[') {
+                ++ans;
+            } else if (ans > 0) {
+                --ans;
+            }
+        }
+        return (ans + 1) >> 1;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minSwaps(string s) {
+        int ans = 0;
+        for (char& c : s)
+        {
+            if (c == '[') ++ans;
+            else if (ans) --ans;
+        }
+        return (ans + 1) >> 1;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minSwaps(s string) int {
+	ans := 0
+	for _, c := range s {
+		if c == '[' {
+			ans++
+		} else if ans > 0 {
+			ans--
+		}
+	}
+	return (ans + 1) >> 1
+}
 ```
 
 ### **...**

solution/1900-1999/1963.Minimum Number of Swaps to Make the String Balanced/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int minSwaps(string s) {
+        int ans = 0;
+        for (char& c : s)
+        {
+            if (c == '[') ++ans;
+            else if (ans) --ans;
+        }
+        return (ans + 1) >> 1;
+    }
+};

solution/1900-1999/1963.Minimum Number of Swaps to Make the String Balanced/Solution.go

@@ -0,0 +1,11 @@
+func minSwaps(s string) int {
+	ans := 0
+	for _, c := range s {
+		if c == '[' {
+			ans++
+		} else if ans > 0 {
+			ans--
+		}
+	}
+	return (ans + 1) >> 1
+}

solution/1900-1999/1963.Minimum Number of Swaps to Make the String Balanced/Solution.java

@@ -0,0 +1,13 @@
+class Solution {
+    public int minSwaps(String s) {
+        int ans = 0;
+        for (char c : s.toCharArray()) {
+            if (c == '[') {
+                ++ans;
+            } else if (ans > 0) {
+                --ans;
+            }
+        }
+        return (ans + 1) >> 1;
+    }
+}

solution/1900-1999/1963.Minimum Number of Swaps to Make the String Balanced/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def minSwaps(self, s: str) -> int:
+        ans = 0
+        for c in s:
+            if c == '[':
+                ans += 1
+            elif ans:
+                ans -= 1
+        return (ans + 1) >> 1