Leetcode brushing record-20. Effective parentheses

Insert picture description here

class Solution:
    def isValid(self, s: str) -> bool:
        leftstack = []
        rightstack = []
        left = ['(','[','{']
        right = [')',']','}']
        doubledict = {'(':')','[':']','{':'}'}
        for letter in s:
            if letter in left:
                leftstack.append(letter)
            elif letter in right:
                if leftstack == [] or doubledict[leftstack.pop(-1)] != letter:
                    return False
        if leftstack != []:
            return False
        return True

        
Published 59 original articles · Liked 14 · Visitors 20,000+

Guess you like

Origin blog.csdn.net/weixin_41545780/article/details/105475583