-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathreverse-parentheses.go
More file actions
63 lines (53 loc) · 1.21 KB
/
reverse-parentheses.go
File metadata and controls
63 lines (53 loc) · 1.21 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
package main
import "fmt"
/**
1190. 反转每对括号间的子串
s = "(ed(et(oc))el)" -> "leetcode"
1. 先将字符串入栈
2. 碰到右括号时，将入栈数据出栈，出栈中遇到一个左括号则反转这个字串
3. 然后将反转的字串在入栈
*/
func reverseParentheses(s string) string {
rightStack := []byte(s)
l := len(rightStack)
leftStack := []byte{}
var b byte
for i := 0; i < l; i++ {
b = rightStack[i]
if string(b) != ")" {
leftStack = append(leftStack, b)
} else {
for j := len(leftStack) - 1; j >= 0; j-- {
if string(leftStack[j]) == "(" {
subByte := leftStack[j:]
sl := len(subByte)
// 存在一个左括号, 无子串
if sl == 1 {
leftStack = leftStack[:j]
} else {
reverseSub := subByte[1:sl]
reverseStringByte1(0, len(reverseSub)-1, reverseSub)
leftStack = leftStack[0:j]
leftStack = append(leftStack, reverseSub...)
}
break
}
}
}
}
return string(leftStack)
}
func reverseStringByte1(start, end int, s []byte) {
c := s[start]
for start < end {
s[start] = s[end]
s[end] = c
start++
end--
c = s[start]
}
}
func main() {
v := reverseParentheses("a(bcdefghijkl(mno)p)q")
fmt.Println(v)
}