-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0020__valid_parenthesis.py
58 lines (40 loc) · 1.27 KB
/
0020__valid_parenthesis.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
"""
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^4
* s consists of parentheses only '()[]{}'.
"""
from unittest import TestCase
class Solution(TestCase):
def test_example_1(self):
self.assertTrue(self.isValid("()"))
def test_example_2(self):
self.assertTrue(self.isValid("()[]{}"))
def test_example_3(self):
self.assertFalse(self.isValid("(]"))
def test_tricky(self):
self.assertFalse(self.isValid("(([{}{]))"))
def isValid(self, s: str) -> bool:
pairs = {")": "(", "]": "[", "}": "{"}
stack = []
for char in s:
if char not in pairs:
stack.append(char)
else:
if not stack or stack[-1] != pairs[char]:
return False
stack.pop()
return len(stack) == 0