python leetcode 20. Valid Parentheses

最新推荐文章于 2022-04-21 23:29:38 发布

原创最新推荐文章于 2022-04-21 23:29:38 发布 · 312 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #leetcode

leetcode_python 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种使用栈数据结构来验证括号是否正确配对的方法。对于包含'(',')','[',']','{','}

Given a string containing just the characters '(', ')', '{', '}', '['and ']', determine if the input string is valid.

有效的括号

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.

Note that an empty string is also considered valid.

Example 1:

Input: "()"
Output: true

Example 2:

Input: "()[]{}"
Output: true

class Solution(object):
    def isValid(self, s):
        """
        :type s: str
        :rtype: bool
        """
        parentheses = {'(': ')', '[': ']', '{': '}'}
        stack = []
        for parenth in s:
            if parenth in parentheses:
                stack.append(parenth)
            elif len(stack) == 0 or parenth != parentheses[stack.pop()]:
                return False
        if stack == []:
            return True
        else:
            return False