【Python】利用栈实现括号匹配

1. MyStack.py

class MyStack():

    def __init__(self):
        self.items = []

    def isEmpty(self):
        return self.items == []

    def push(self, item):
        self.items.append(item)

    def pop(self):
        return self.items.pop()

    def peek(self):
        return self.items[len(self.items)-1]

    def size(self):
        return len(self.items)

    def __str__(self):
        return f'{self.items}'
        

2. par_match.py

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time    : 2023/7/14 21:53
# @Author  : Sophia
# @File    : csdn_match.py
# @Software: PyCharm
from MyStack import MyStack

def par_math(str_par):
    my_stack = MyStack()
    balanced = True  # 左右括号是否匹配
    indx = 0
    while indx < len(str_par) and balanced:
        symbol = str_par[indx]
        # # pure parenthesis
        # if symbol == '(':
        # my_stack.push(symbol)
        # else:
        # if my_stack.isEmpty():
        # return False
        # else:
        # my_stack.pop()

		# more symbol
        if symbol in '([{':
            my_stack.push(symbol)
        else:
            if my_stack.isEmpty():
                balanced = False
            else:
                top = my_stack.pop()
                if not matches(top, symbol):
                    balanced = False
        # 必须有啊，没的话无限循环了
        indx = indx + 1

    # 最后栈为空，匹配完毕
    if balanced and my_stack.isEmpty():
        return True
    else:
        return False


def matches(open, close):
    opens = '([{'
    closes = ')]}'
    return opens.index(open) == closes.index(close)

if __name__ == '__main__':
    str_par = '([{])'
    res = par_math(str_par)
    print(res)

3. 结果

False

4. 注意点

1. 栈的push()与pop()操作由python列表实现。注意时间复杂度为O(1).
2. 若symbol不为左括号且栈为空，说明匹配存在问题，return False。