-
Notifications
You must be signed in to change notification settings - Fork 0
/
validparentheses.go
71 lines (59 loc) · 961 Bytes
/
validparentheses.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
package leetcode
/*
https://leetcode.com/problems/valid-parentheses/
*/
func isValid(s string) bool {
arr := make([]rune, len(s))
if len(s)%2 == 1 {
return false
}
j := 0
result := true
for _, val := range s {
if val == '(' || val == '[' || val == '{' {
arr[j] = val
j = j + 1
} else {
if j == 0 {
return false
}
previous := arr[j-1]
if val == ')' && previous == '(' {
j = j - 1
} else if val == ']' && previous == '[' {
j = j - 1
} else if val == '}' && previous == '{' {
j = j - 1
} else {
return false
}
}
}
if j > 0 {
return false
}
return result
}
var m = map[rune]rune{
'[': ']',
'{': '}',
'(': ')',
}
func isValidUpdated(s string) bool {
stack := make([]rune, len(s))
idx := -1
for _, v := range s {
if idx == -1 {
idx++
stack[idx] = v
} else {
if m[stack[idx]] == v {
idx--
} else {
idx++
stack[idx] = v
}
}
}
return idx == -1
}