leetcode 链接:https://leetcode-cn.com/problems/valid-parentheses/submissions/
stack python: 44 ms, 10.8 MB
class Solution(object):
def isValid(self, s):
"""
:type s: str
:rtype: bool
"""
parentheses_dict = {")": "(", "}": "{", "]": "["}
stack_list = []
for i in range(len(s)):
if s[i] in parentheses_dict:
if stack_list and stack_list[-1] == parentheses_dict[s[i]]:
stack_list = stack_list[:-1]
else:
return False
else:
stack_list.append(s[i])
if stack_list: return False
return True
其他方法看 leetcode 链接 评论区~