Leetcode 20: Valid Parentheses

题目：


python code:

class Solution:
    def isValid(self, s: str) -> bool:
        stack = []
        for i in range(len(s)):
            character = s[i]
            if character != '(' and character != "{" and character != '[' and character != ")" and character != ']' and character != '}':
                continue
            if character == "(" or character == "{" or character == '[':
                stack.append(character)
                continue
            elif character == ')' and (len(stack) == 0 or stack[-1] != '('):
                return False
            elif character == ']' and (len(stack) == 0 or stack[-1] != '['):
                return False
            elif character == '}' and (len(stack) == 0 or stack[-1] != '{'):
                return False
            stack.pop() 
        return not len(stack)

代码用了经典的栈的思想来实现

特殊结果如下：

如果觉得不错，就点赞关注留言
谢谢~