-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1021-RemoveOutermostParentheses.go
More file actions
107 lines (94 loc) · 3.65 KB
/
1021-RemoveOutermostParentheses.go
File metadata and controls
107 lines (94 loc) · 3.65 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
package main
// 1021. Remove Outermost Parentheses
// A valid parentheses string is either empty "", "(" + A + ")", or A + B,
// where A and B are valid parentheses strings, and + represents string concatenation.
// For example, "", "()", "(())()", and "(()(()))" are all valid parentheses strings.
// A valid parentheses string s is primitive if it is nonempty,
// and there does not exist a way to split it into s = A + B, with A and B nonempty valid parentheses strings.
// Given a valid parentheses string s, consider its primitive decomposition:
// s = P1 + P2 + ... + Pk, where Pi are primitive valid parentheses strings.
// Return s after removing the outermost parentheses of every primitive string in the primitive decomposition of s.
// Example 1:
// Input: s = "(()())(())"
// Output: "()()()"
// Explanation:
// The input string is "(()())(())", with primitive decomposition "(()())" + "(())".
// After removing outer parentheses of each part, this is "()()" + "()" = "()()()".
// Example 2:
// Input: s = "(()())(())(()(()))"
// Output: "()()()()(())"
// Explanation:
// The input string is "(()())(())(()(()))", with primitive decomposition "(()())" + "(())" + "(()(()))".
// After removing outer parentheses of each part, this is "()()" + "()" + "()(())" = "()()()()(())".
// Example 3:
// Input: s = "()()"
// Output: ""
// Explanation:
// The input string is "()()", with primitive decomposition "()" + "()".
// After removing outer parentheses of each part, this is "" + "" = "".
// Constraints:
// 1 <= s.length <= 10^5
// s[i] is either '(' or ')'.
// s is a valid parentheses string.
import "fmt"
func removeOuterParentheses(s string) string {
res, count := "", 0
for _, v := range s {
if v == '(' {
count++
} else {
count--
}
if !(count == 0 && v == ')') && !(count == 1 && v == '(') {
res = res + string(v)
}
}
return res
}
func removeOuterParentheses1(s string) string {
stack, left := make([]byte, 0), 0
for _, v := range []byte(s) {
if left == 0 {
left++
} else {
if v == '(' {
stack = append(stack, v)
left++
} else {
if left == 1 {
left--
continue
}
stack = append(stack, v)
left--
}
}
}
return string(stack)
}
func main() {
// Example 1:
// Input: s = "(()())(())"
// Output: "()()()"
// Explanation:
// The input string is "(()())(())", with primitive decomposition "(()())" + "(())".
// After removing outer parentheses of each part, this is "()()" + "()" = "()()()".
fmt.Println(removeOuterParentheses("(()())(())")) // "()()()"
// Example 2:
// Input: s = "(()())(())(()(()))"
// Output: "()()()()(())"
// Explanation:
// The input string is "(()())(())(()(()))", with primitive decomposition "(()())" + "(())" + "(()(()))".
// After removing outer parentheses of each part, this is "()()" + "()" + "()(())" = "()()()()(())".
fmt.Println(removeOuterParentheses("(()())(())(()(()))")) // "()()()()(())"
// Example 3:
// Input: s = "()()"
// Output: ""
// Explanation:
// The input string is "()()", with primitive decomposition "()" + "()".
// After removing outer parentheses of each part, this is "" + "" = "".
fmt.Println(removeOuterParentheses("()()")) // ""
fmt.Println(removeOuterParentheses1("(()())(())")) // "()()()"
fmt.Println(removeOuterParentheses1("(()())(())(()(()))")) // "()()()()(())"
fmt.Println(removeOuterParentheses1("()()")) // ""
}