LeetCode2021.3.11-括号匹配

最新推荐文章于 2025-12-03 12:28:21 发布

原创最新推荐文章于 2025-12-03 12:28:21 发布 · 134 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#栈 #stack #python #数据结构 #leetcode

LeetCode 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一种使用栈数据结构来实现括号匹配的有效方法。该方法可以检查输入字符串中的括号是否正确配对并闭合，包括圆括号'()',方括号'[]'和花括号'{}

括号匹配

def isValid(s):
    """
    :type s: str
    :rtype: bool
    """
    stack = []
    ftype1 = '('
    ftype2 = '['
    ftype3 = '{'
    btype1 = ')'
    btype2 = ']'
    btype3 = '}'
    for ele in s:
        if ele in '([{':
            stack.append(ele)
        elif ele in ')]}':
            if not stack:
                return False
            if stack:
                if ele == btype1 and stack[-1] == ftype1 or ele == btype2 and stack[-1] == ftype2 or ele == btype3 and \
                        stack[-1] == ftype3:
                    stack.pop()
                else:
                    return False

    if not stack:
        return True
    else:
        return False