-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvalid_parentheses.py
50 lines (42 loc) · 1.29 KB
/
valid_parentheses.py
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
# https://leetcode.com/problems/valid-parentheses/description/
# 20. Valid Parentheses
# 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.
# Every close bracket has a corresponding open bracket of the same type.
# Example 1:
# Input: s = "()"
# Output: true
# Example 2:
# Input: s = "()[]{}"
# Output: true
# Example 3:
# Input: s = "(]"
# Output: false
# Constraints:
# 1 <= s.length <= 104
# s consists of parentheses only '()[]{}'.
class Solution(object):
def isValidParentheses(self, s) -> bool:
''' Valid Parentheses '''
stack = [] # only use append and pop
pairs = {
'(': ')',
'{': '}',
'[': ']'
}
for bracket in s:
if bracket in pairs:
stack.append(bracket)
elif len(stack) == 0 or bracket != pairs[stack.pop()]:
return False
return len(stack) == 0
s = "()[]{}"
print(Solution().isValidParentheses(s))
# Output: True
s = "(]"
print(Solution().isValidParentheses(s))
# Output: False
print(Solution().isValidParentheses("([][])[]{}"))
# Output: True