python实现栈的基本操作

#堆栈实现
class Stack():
    
    def __init__(self,size): #构建空栈
        self.size=size
        self.stack=[]
        self.top=-1
        
    def isempty(self):     #判断栈空
        return self.top==-1
    
    
    def isfull(self):      #判断栈满
        return self.top==self.size-1
    
    
    def push(self,x):       #入栈
        if self.isfull():   #入栈检查栈满，出栈检查栈空
            raise exception("stack is full")
        else:
            self.stack.append(x)
            self.top+=1  
    
    
    def Pop(self):          #出栈
        if self.isempty():  #出栈检查栈空
            raise exception ("stack is empty")    #抛出异常
        else:
            self.stack.pop()
            self.top-=1
    
    
    def showStack(self):   #打印栈
        print(self.stack)
        

    


s=Stack(6)
for i in range(6):
    s.push(i)
    s.showStack()
    print("栈是否满了")
    print(s.isfull())
for i in range(6):
    s.Pop()
    s.showStack()
    print("栈是否空了")
    print(s.isempty())