class Solution20:
def isValid(self, s):
stack = []
paren_map = {
')': '(',
']': '[',
'}': '{'
}
for c in s:
if c not in paren_map:
stack.append(c)
elif not stack or paren_map[c] != stack.pop():
return False
return not stack
leetcode20 合法的括号 栈 python版本
最新推荐文章于 2022-04-08 16:55:06 发布