-
Notifications
You must be signed in to change notification settings - Fork 17
/
Valid_Parentheses_020.py
68 lines (57 loc) · 1.45 KB
/
Valid_Parentheses_020.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
'''
Given a string 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.
Note that an empty string is also considered valid.
Example 1:
Input: "()"
Output: true
Example 2:
Input: "()[]{}"
Output: true
Example 3:
Input: "(]"
Output: false
Example 4:
Input: "([)]"
Output: false
Example 5:
Input: "{[]}"
Output: true
'''
class Solution:
def isValid(self, s):
"""
:type s: str
:rtype: bool
"""
while s.find("()") != -1 or s.find("[]") != -1 or s.find("{}") != -1:
if s.find("()") != -1:
s = s.replace("()", "")
if s.find("[]") != -1:
s = s.replace("[]", "")
if s.find("{}") != -1:
s = s.replace("{}", "")
return len(s) == 0
class Solution_better:
def isValid(self, s):
"""
:type s: str
:rtype: bool
"""
mapping = {
'(': ')',
'{': '}',
'[': ']',
}
stack = []
for char in s:
if char in mapping:
stack.append(char)
else:
if not stack:
return False
if mapping[stack.pop()] != char:
return False
return False if stack else True