栈-力扣20 有效括号

class Solution:
    def isValid(self, s: str) -> bool:  
        dic = {'(':')', '[':']', '{':'}', '?':'?'}
        # 问号的作用是解决边界空栈.pop报错
        stack = ['?']
        for i in s:
            if i in dic:
                stack.append(i)
            elif dic[stack.pop()] != i :
                return False
        # 解决如果剩一个单左括号，如果直接return stack会返回T rue
        return len(stack) == 1