-
Notifications
You must be signed in to change notification settings - Fork 2
/
020 Valid Parentheses.py
60 lines (44 loc) · 1.28 KB
/
020 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
51
52
53
54
55
56
57
58
59
60
'''
20 Valid Parentheses
https://leetcode.com/problems/valid-parentheses/
Given a string 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.
Note that an empty string is also considered valid.
Example 1:
Input: "()"
Output: true
Example 2:
Input: "()[]{}"
Output: true
Example 3:
Input: "(]"
Output: false
Example 4:
Input: "([)]"
Output: false
Example 5:
Input: "{[]}"
Output: true
'''
class Solution:
def isValid(self, s: str) -> bool:
leftParentheses = ['(', '[', '{']
def arePaired(left: str, right: str) -> bool:
if left == '(':
return right == ')'
elif left == '[':
return right == ']'
elif left == '{':
return right == '}'
stack = []
for c in s:
if c in leftParentheses:
stack.append(c)
else:
if not stack or not arePaired(stack[-1], c):
return False
stack.pop()
return not stack