class Solution:
def isValid(self, s: str) -> bool:
if len(s) % 2 == 1:
return False
pairs = {
")": "(",
"]": "[",
"}": "{",
}
stack = list() # 建立一个顺序栈
for ch in s:
if ch in pairs: # 按键查找
if not stack or stack[-1] != pairs[ch]: # 栈为空或者栈的最后一个元素与右边符号不匹配
return False
stack.pop()
else: # 把左边符号入栈
stack.append(ch)
return not stack
s = Solution()
print(s.isValid("()"))
08-07
1192
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)