-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20.isValid.py
70 lines (64 loc) · 1.45 KB
/
20.isValid.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
# 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 <= 10⁴
# s consists of parentheses only '()[]{}'.
#
#
# Related Topics String Stack 👍 22779 👎 1586
# leetcode submit region begin(Prohibit modification and deletion)
class Solution:
def isValid(self, s: str) -> bool:
if len(s) % 2 != 0:
return False
stack = []
for i in range(0, len(s)):
if s[i] == "(":
stack.append(")")
elif s[i] == "[":
stack.append("]")
elif s[i] == "{":
stack.append("}")
elif not stack and s[i] != stack[-1]: # NOTE: if brackets didn't match and stack is not empty
return False
else:
stack.pop()
return True if not stack else False # true if matchs)
# leetcode submit region end(Prohibit modification and deletion)
if __name__ == "__main__":
s = Solution()
print(s.isValid("(]"))