栈的自定义实现

 

 

class zhan:
    def __init__(self):
        self.items=[]
    def push(self,item):
        self.items.append(item)
    def pop(self):
        if not self.items:
            return 'None'
        else:
            return self.items.pop()
    def isEmpty(self):
        if not self.items:
            print('True')
        else:
            print('False')
    def size(self):
        print(len(self.items))
    def top(self):
        if not self.items:
            print('None')
        else:
            print(self.items[-1])
    def printstack(self):
        print(self.items)
l=zhan()
n=int(input())
for i in range(0,n):
    a=input().split()
    if a[0]=='push':
        l.items.append(int(a[1]))
    elif a[0]=='pop':
        print(zhan.pop(l))
    elif a[0]=='isEmpty':
        zhan.isEmpty(l)
    elif a[0]=='size':
        zhan.size(l)
    elif a[0]=='top':
        zhan.top(l)
    elif a[0]=='printStack':
        zhan.printstack(l)