-
Notifications
You must be signed in to change notification settings - Fork 29
/
0020-Valid-Parentheses.py
48 lines (37 loc) · 976 Bytes
/
0020-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
'''
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
'''
# Time Complexity: O(n)
# Space Complexity: O(n)
# Solution using Stack
class Solution:
def isValid(self, s: str) -> bool:
if len(s) % 2:
return False
parens = {'(' : ')', '{' : '}', '[' : ']'}
stack = []
for paren in s:
if paren in parens.keys():
stack.append(paren)
elif not stack or paren != parens[stack.pop()]:
return False
return not stack