-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution20.go
152 lines (146 loc) · 2.57 KB
/
solution20.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
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
package solution20
// ============================================================================
// 20. Valid Parentheses
// URL: https://leetcode.com/problems/valid-parentheses/
// ============================================================================
/*
goos: linux
goarch: amd64
pkg: GoLeetCode/solutions/20---Valid-Parentheses
cpu: 13th Gen Intel(R) Core(TM) i7-13700K
Benchmark_isValid
Benchmark_isValid-24 100000000 11.88 ns/op 2 B/op 1 allocs/op
PASS
*/
func isValid(s string) bool {
length := len(s)
if length <= 1 || length > 10_000 || length%2 == 1 {
return false
}
var a, b byte
var l int
st := make([]byte, 0, length)
for i := 0; i < length; i++ {
a = s[i]
if a == '(' || a == '[' || a == '{' {
st = append(st, a)
continue
}
l = len(st)
if i == 0 || l == 0 {
return false
}
if l > 0 {
b = st[l-1]
switch {
case a == ')' && b == '(':
st = append(st[:l-1], st[l:]...)
case a == ']' && b == '[':
st = append(st[:l-1], st[l:]...)
case a == '}' && b == '{':
st = append(st[:l-1], st[l:]...)
default:
return false
}
}
}
return len(st) == 0
}
/*
func isValid(s string) bool {
length := len(s)
if length <= 1 || length > 10_000 || length%2 == 1 {
return false
}
var a, b byte
m := map[byte]int{
'(': 0,
'[': 0,
'{': 0,
')': 0,
']': 0,
'}': 0,
}
for i := 0; i < length; i++ {
a = s[i]
fmt.Printf("i: %d, %c == %c\n", i, a, b)
if a == '(' || a == '[' || a == '{' {
m[a]++
b = a
fmt.Println("add")
continue
}
if a == ')' && b == '(' ||
a == ']' && b == '[' ||
a == '}' && b == '{' {
m[b]--
fmt.Println("del")
}
b = a
}
fmt.Printf("Map (output): %v\n", m)
for _, v := range m {
if v != 0 {
return false
}
}
return true
}
*/
/*
func isValid(s string) bool {
length := len(s)
if length < 1 || length > 10_000 {
return false
}
var a, b byte
var d int
for i := 0; i < length/2; i++ {
a = s[d]
b = s[d+1]
fmt.Printf("%d, %c = %c\n", d, a, b)
if a == '(' && b != ')' ||
a == '[' && b != ']' ||
a == '{' && b != '}' {
return false
}
d += 2
}
return true
}
*/
/*
func isValid_One(s string) bool {
length := len(s)
if length < 1 {
return false
}
m := map[byte]int{
'(': 0,
'[': 0,
'{': 0,
}
for i := 0; i < length; i++ {
ch := s[i]
switch ch {
case '(':
m[ch]++
case '[':
m[ch]++
case '{':
m[ch]++
case ')':
m['(']--
case ']':
m['[']--
case '}':
m['{']--
}
}
fmt.Printf("map: %v\n", m)
if m['('] == 0 && m['['] == 0 && m['{'] == 0 {
return true
}
return false
}
*/