Python列表实现栈

# Python列表实现栈
class Stack():
    def __init__(self):
        self.items = []
        
    # 用于print    
    def __str__(self): 
        return str(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 isEmpty(self):
        return self.items==[]
    # 栈的大小
    def size(self):
        return len(self.items)
        
if __name__=="__main__":
    s = Stack()
    print("s",s)
    print(s.isEmpty())
    s.push(4)
    print("s",s)
    s.push('dog')
    print("s",s)
    print("peek",s.peek())
    s.push(True)
    print(str(s),"size",s.size())
    print('isEmoty',s.isEmpty())
    s.push(8.4)
    print("pop",s.pop())
    print("pop",s.pop())
    print(s,"size",s.size())

输出：

s []
True
s [4]
s [4, 'dog']
peek dog
[4, 'dog', True] size 3
isEmoty False
pop 8.4
pop True
[4, 'dog'] size 2