-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathproblem027.go
More file actions
65 lines (58 loc) · 1.07 KB
/
Copy pathproblem027.go
File metadata and controls
65 lines (58 loc) · 1.07 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
package problem027
type stack struct {
buffer []rune
}
func newStack() *stack {
return &stack{buffer: []rune{}}
}
func (s *stack) push(value rune) *stack {
s.buffer = append(s.buffer, value)
return s
}
func (s *stack) pop() rune {
value := s.buffer[len(s.buffer)-1]
s.buffer = s.buffer[:len(s.buffer)-1]
return value
}
func (s *stack) isEmpty() bool {
return len(s.buffer) == 0
}
func bracketMatched(bracket rune, pair rune) bool {
switch pair {
case ')':
return bracket == '('
case '}':
return bracket == '{'
case ']':
return bracket == '['
default:
return false
}
}
func ValidateBrackets(brackets string) bool {
bracketStack := newStack()
for _, bracket := range []rune(brackets) {
switch bracket {
case '(':
fallthrough
case '{':
fallthrough
case '[':
bracketStack.push(bracket)
case ')':
fallthrough
case '}':
fallthrough
case ']':
if bracketStack.isEmpty() {
return false
}
if !bracketMatched(bracketStack.pop(), bracket) {
return false
}
default:
return false
}
}
return bracketStack.isEmpty()
}