-
Notifications
You must be signed in to change notification settings - Fork 0
/
top_interview_150__20_valid_parentheses.py
66 lines (53 loc) · 1.74 KB
/
top_interview_150__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
54
55
56
57
58
59
60
61
62
63
64
65
66
# https://leetcode.com/problems/valid-parentheses/
class WrongSolution:
def isValid(self, s: str) -> bool:
"""
'(', ')', '{', '}', '[' and ']'
"""
par_counter = 0
par_open = False
curly_counter = 0
curly_open = False
rect_counter = 0
rect_open = False
for ch in s:
if ch == "[":
rect_counter += 1
rect_open = True
if ch == "]":
rect_counter -= 1
rect_open = False
if ch == "(":
par_counter += 1
par_open = True
if ch == ")":
par_counter -= 1
par_open = False
if ch == "{":
curly_counter += 1
curly_open = True
if ch == "}":
curly_counter -= 1
curly_open = False
return not par_counter and not par_open and not rect_counter and not rect_open and not curly_counter and not curly_open
class Solution:
def isValid(self, s: str) -> bool:
stack = []
for ch in s:
if ch in "({[":
stack.append(ch)
else:
if not stack or \
(ch == ")" and stack[-1] != "(") or (ch == "]" and stack[-1] != "[") or (ch == "}" and stack[-1] != "{"):
return False
stack.pop()
return not stack
sol = Solution()
s = "{}[][]()"
print(s, sol.isValid(s))
s = "{}[][]())"
print(s, sol.isValid(s))
s = "{}[]][())"
print(s, sol.isValid(s))
s = "([)]"
print(s, sol.isValid(s))