-
Notifications
You must be signed in to change notification settings - Fork 62
/
Copy pathvalid_parentheses.go
59 lines (53 loc) · 1.08 KB
/
valid_parentheses.go
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
package main
import (
"strings"
)
//有效的括号
//暴力求解,分别匹配并替换 () [] {}
func isValid1(s string) bool {
for len(s) > 0 {
n := len(s)
s = strings.Replace(s, "()", "", -1)
s = strings.Replace(s, "[]", "", -1)
s = strings.Replace(s, "{}", "", -1)
if len(s) == n {
break
}
}
return len(s) == 0
}
//第二种解法,借助一个栈
func isValid2(s string) bool {
m := map[rune]rune{')': '(', ']': '[', '}': '{'}
var stack []rune
for _, v := range s {
if _, ok := m[v]; !ok {
stack = append(stack, v)
} else {
if len(stack) == 0 || stack[len(stack)-1] != m[v] {
return false
}
stack = stack[:len(stack)-1]
}
}
return len(stack) == 0
}
// 另一种写法
func isValid3(s string) bool {
var stack []int
for _, v := range s {
if v == '(' {
stack = append(stack, ')')
} else if v == '[' {
stack = append(stack, ']')
} else if v == '{' {
stack = append(stack, '}')
} else {
if len(stack) == 0 || stack[len(stack)-1] != int(v) {
return false
}
stack = stack[:len(stack)-1]
}
}
return len(stack) == 0
}