-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleetcode 20 - valid parentheses.py
53 lines (35 loc) · 1.28 KB
/
leetcode 20 - 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
"""
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.
Question: https://leetcode.com/problems/valid-parentheses/
"""
class Solution:
def isValid(self, s: str) -> bool:
para = {')':'(', ']':'[', '}':'{'}
op = ['(','[', '{']
stack = []
for c in s:
if c in op:
stack.append(c)
elif c in para:
if len(stack) != 0 and stack[-1] == para[c]:
stack.pop()
else:
return False
if len(stack) == 0:
return True
else:
return False
# if c in para:
# if len(stack) != 0 and stack[-1] == para[c]:
# stack.pop()
# else:
# return False
# else:
# stack.append(c)
# if len(stack) == 0:
# return True
# else:
# False