Merge pull request #835 from 0xff-dev/1249

Add solution and test-cases for problem 1249

Author: 6boris

leetcode/1201-1300/1249.Minimum-Remove-to-Make-Valid-Parentheses/README.md

@@ -1,28 +1,39 @@
 # [1249.Minimum Remove to Make Valid Parentheses][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+Given a string s of `'('` , `')'` and lowercase English characters.
+
+Your task is to remove the minimum number of parentheses ( `'('` or `')'`, in any positions ) so that the resulting parentheses string is valid and return **ans** valid string.
+
+Formally, a parentheses string is valid if and only if:
+
+- It is the empty string, contains only lowercase characters, or
+- It can be written as `AB` (`A` concatenated with `B`), where `A` and `B` are valid strings, or
+- It can be written as `(A)`, where `A` is a valid string.
+
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: s = "lee(t(c)o)de)"
+Output: "lee(t(c)o)de"
+Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
 ```
 
-## 题意
-> ...
+**Example 2:**
 
-## 题解
-
-### 思路1
-> ...
-Minimum Remove to Make Valid Parentheses
-```go
 ```
+Input: s = "a)b(c)d"
+Output: "ab(c)d"
+```
+
+**Example 3:**
 
+```
+Input: s = "))(("
+Output: ""
+Explanation: An empty string is also valid.
+```
 
 ## 结语
 

leetcode/1201-1300/1249.Minimum-Remove-to-Make-Valid-Parentheses/Solution.go

@@ -1,5 +1,38 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "strings"
+
+func Solution(s string) string {
+	left := -1
+	stack := make([]int, len(s))
+	removes := make([]int, 0)
+	for i := range s {
+		if s[i] == '(' {
+			left++
+			stack[left] = i
+			continue
+		}
+		if s[i] == ')' {
+			if left >= 0 {
+				left--
+			} else {
+				removes = append(removes, i)
+			}
+		}
+	}
+	check := make(map[int]struct{})
+	for i := 0; i <= left; i++ {
+		check[stack[i]] = struct{}{}
+	}
+	for _, idx := range removes {
+		check[idx] = struct{}{}
+	}
+	buf := strings.Builder{}
+	for i := 0; i < len(s); i++ {
+		if _, ok := check[i]; ok {
+			continue
+		}
+		buf.WriteByte(s[i])
+	}
+	return buf.String()
 }

leetcode/1201-1300/1249.Minimum-Remove-to-Make-Valid-Parentheses/Solution_test.go

@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs string
+		expect string
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", "lee(t(c)o)de)", "lee(t(c)o)de"},
+		{"TestCase2", "a)b(c)d", "ab(c)d"},
+		{"TestCase3", ")))(((", ""},
 	}
 
 	//	开始测试
@@ -30,10 +30,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }