-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
20.py
106 lines (106 loc) · 3.22 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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
__________________________________________________________________________________________________
32ms
class Solution:
def isValid(self, s: 'str') -> 'bool':
v = []
d = {']':'[', ')':'(', '}':'{'}
for i in range(len(s)):
if s[i] in d.values():
v.append(s[i])
elif s[i] in d.keys():
if len(v) == 0:
return False
elif v[-1] == d[s[i]]:
v.pop()
else:
return False
if v == []:
return True
else:
return False
__________________________________________________________________________________________________
36ms
class Solution:
def isValid(self, s: str) -> bool:
if not s:
return True
st = []
for ch in s:
if ch == '[':
st.append(']')
elif ch == '{':
st.append('}')
elif ch == '(':
st.append(')')
elif not st or st.pop()!=ch:
return False
return st == []
__________________________________________________________________________________________________
40ms
class Solution:
def isValid(self, s: str) -> bool:
stack = []
bra = ('(', ')')
cur = ('{', '}')
squ = ('[', ']')
brackets = [bra, cur, squ]
for char in s:
for b in brackets:
if char == b[0]:
stack.append(b[0])
elif char == b[1]:
if len(stack) <= 0:
return False
last = stack.pop()
if not last == b[0]:
return False
return len(stack) == 0
__________________________________________________________________________________________________
12128 kb
class Solution:
def isValid(self, s: 'str') -> 'bool':
dictt = {')': '(',
']' : '[',
'}' : '{'}
que = ''
i = 0
while i < len(s):
if s[i] in dictt:
if que == '':
return False
elif que[-1] == dictt[s[i]]:
que = que[:-1]
i += 1
else:
return False
else:
que += s[i]
i += 1
if que == '':
return True
return False
__________________________________________________________________________________________________
12136 kb
class Solution:
def isValid(self, s: 'str') -> 'bool':
dictt = {')': '(',
']' : '[',
'}' : '{'}
que = []
i = 0
while i < len(s):
if s[i] in dictt:
if que == []:
return False
elif que[-1] == dictt[s[i]]:
que = que[:-1]
i += 1
else:
return False
else:
que.append(s[i])
i += 1
if que == []:
return True
return False
__________________________________________________________________________________________________