-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20.py
78 lines (52 loc) · 1.6 KB
/
20.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
67
68
69
70
71
72
73
74
75
76
77
78
"""
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.
Every close bracket has a corresponding open bracket of the same type.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Constraints:
1 <= s.length <= 104
s consists of parentheses only '()[]{}'.
"""
from typing import List
class Solution:
def isValid(self, s: str) -> bool:
if len(s) == 1:
return False
stack = []
# opening = ['[', '(', '{']
# closing = [']', ')', '}']
# for bracket in s:
# if bracket in opening:
# stack.append(bracket)
# else:
# if len(stack) == 0:
# return False
# last = stack.pop()
# if last not in opening:
# return False
# return len(stack) == 0
opening = ["[", "(", "{"]
# closing = [']', ')', '}']
pairs = ["[]", "()", "{}"]
for bracket in s:
if bracket in opening:
stack.append(bracket)
continue
# impossible to pop
if len(stack) == 0:
return False
first_out = stack.pop()
if f"{first_out + bracket}" not in pairs:
return False
return len(stack) == 0
print(Solution().isValid(s="["))