-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path20_Valid_Parentheses.py
More file actions
65 lines (48 loc) · 1.38 KB
/
20_Valid_Parentheses.py
File metadata and controls
65 lines (48 loc) · 1.38 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
'''
20. Valid Parentheses
Easy
2634
131
Favorite
Share
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:
stack = []
lookup = {"(":")", "[":']', '{':'}'}
for parentheses in s:
if parentheses in lookup:
stack.append(parentheses)
#stored found ( in stack
# if the ( match with )
elif len(stack) == 0 or lookup[stack.pop()] != parentheses:
#use pop to pop the (, put it into lookup see if it matches
return False
#len(stack) == 0 : for situation where it's input with )
return len(stack) == 0
"""
Success
Details
Runtime: 52 ms, faster than 24.18% of Python3 online submissions for Valid Parentheses.
Memory Usage: 13.3 MB, less than 5.22% of Python3 online submissions for Valid Parentheses.
"""