class Queue:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
# input在前,output在后
def enqueue(self,item):
self.items.insert(0,item)
def dequeue(self):
return self.items.pop()
def size(self):
return len(self.items)
def show(self):
return self.items
# 双端队列中的元素可以从两端弹出,插入和删除操作限定在队列的两端进行
class Deques:
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def add_front(self,item):
return self.items.append(item)
def add_rear(self,item):
return self.items.insert(0,item)
def remove_front(self):
self.items.pop()
def remove_rear(self):
self.items.pop(0)
def size(self):
return len(self.items)