class queue:
def __init__(self):
self.items=[]
def push(self,item):
self.items.append(item)
def pop(self):
if not self.items:
print('None')
else:
print(self.items.pop(0))
def isEmpty(self):
print(not self.items)
def size(self):
print(len(self.items))
def peek(self):
if not self.items:
print('None')
else:
print(self.items[0])
def printqueue(self):
print(self.items)
l=queue()
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':
queue.pop(l)
elif a[0]=='isEmpty':
queue.isEmpty(l)
elif a[0]=='size':
queue.size(l)
elif a[0]=='peek':
queue.peek(l)
elif a[0]=='printQueue':
queue.printqueue(l)
队列的自定义实现
最新推荐文章于 2024-07-12 16:16:27 发布