-
Notifications
You must be signed in to change notification settings - Fork 0
/
20_valid_parentheses.py
52 lines (48 loc) · 1.83 KB
/
20_valid_parentheses.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
class Solution:
def isValid(self, s: str) -> bool:
# 只输入一个右括号"]"
if len(s) == 0:
return True
chs = []
ans = False
for i in range(len(s)):
if s[i] == '(' or s[i] == '{' or s[i] == '[':
chs.append(s[i])
elif s[i] == ')':
if len(chs) == 0 or chs[-1] != '(':
chs.append(' ')
break
else:
chs.pop()
elif s[i] == ']':
if len(chs) == 0 or chs[-1] != '[':
chs.append(' ')
break
else:
chs.pop()
elif s[i] == '}':
if len(chs) == 0 or chs[-1] != '{':
chs.append(' ')
break
else:
chs.pop()
else:
pass
if len(chs) == 0:
ans = True
return ans
'''
This is my personal record of solving Leetcode Problems.
If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
Copyright (C) 2020-2022 mengxinayan
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''