-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0020_valid_parentheses.go
54 lines (49 loc) · 1.09 KB
/
0020_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
// https://leetcode.com/problems/valid-parentheses
//
// 0020. Valid Parentheses [Easy]
//
// Given a string s containing just the characters '(', ')', '{', '}', '[' and
// ']', determine if the input string is valid.
//
// An input string is valid if:
//
// Open brackets must be closed by the same type of brackets.
// Open brackets must be closed in the correct order.
//
// Constraints:
//
// 1 <= s.length <= 104
// s consists of parentheses only '()[]{}'.
package leetcode
func IsValidParentheses(input string) bool {
if len(input)%2 != 0 {
return false
}
isPair := func(b1, b2 rune) bool {
switch {
case b1 == '(' && b2 == ')':
return true
case b1 == '[' && b2 == ']':
return true
case b1 == '{' && b2 == '}':
return true
default:
return false
}
}
var stack []rune
for _, curr := range input {
if curr == '(' || curr == '[' || curr == '{' {
stack = append(stack, curr)
continue
}
if len(stack) == 0 {
return false
}
if prev := stack[len(stack)-1]; !isPair(prev, curr) {
return false
}
stack = stack[:len(stack)-1]
}
return len(stack) == 0
}