蓝桥杯数据结构整理-栈（Python 自用）

栈快速实现

class Stack(object):
    def __init__(self,limit = 10):
        self.stack = [1,2,3] #存放元素
        self.limit = limit #栈容量极限
    #push进栈
    def push(self,data):
        #判断栈是否溢出
        if len(self.stack) >= self.limit:
            raise IndexError('超出栈容量极限')
        self.stack.append(data)
    #pop退栈
    def pop(self):
        if self.stack:
            return self.stack.pop()
        else:
            raise IndexError('pop from an empty stack')#空栈无法弹出
    #查看堆栈最上面的元素
    def peek(self):
        if self.stack:
            return self.stack[-1]
    #判断栈是否为空
    def is_empty(self):
        return not bool(self.stack)
    #返回栈的大小
    def size(self):
        return len(self.stack)

栈快速应用-括号匹配

class Stack(object):
    #初始化
    def __init__(self,limit = 10):
        self.stack = []
        self.limit = limit
    #进栈操作
    def push(self,data):
        if len(self.stack) >= self.limit:
            raise IndexError('超出栈容量极限')
        self.stack.append(data)
    #出栈操作
    def pop(self):
        if self.stack:
            return self.stack.pop()
        else:
            return IndexError('pop from an empty stack')
    #查看栈顶最上面的元素
    def peek(self):
        if self.stack:
            return self.stack[-1]
    #判空
    def is_empty(self):
        return not bool(self.stack)
    #长度
    def length(self):
        return len(self.stack)
#判断括号是否匹配
def balanced_parentheses(parentheses):
    stack = Stack(len(parentheses))
    for parenthesis in parentheses:
        if parenthesis == '(':
            stack.push(parenthesis)
        elif parenthesis == ')':
            if stack.is_empty():
                return False
            stack.pop()
    return stack.is_empty()
if __name__ == '__main__':
    kuo = [list(i for i in input()) for i in range(3)]
    print('Balanced parentheses demonstration:\n')
    for k in kuo:
        print('True or False',balanced_parentheses(k))