队列是一种先进先出的数据结构,主要操作包括入队,出队。入队的元素加入到对尾,从队头取出出队的元素。在QuecPython中我们可以使用list操作来模拟队列:
class queue:
def __init__(self):
self.__alist = []
def push(self, value):
self.__alist.insert(0, value)
def pop(self):
return self.__alist.pop()
def size(self):
return len(self.__alist)
def clean(self):
self.__alist.clear()
def isEmpty(self):
return self.__alist == []
def showQueue(self):
print(self.__alist)
运行:
if __name__ == '__main__':
q = queue()
q.push(1)
q.push("123")
q.push("456")
q.push(2)
q.showQueue()
print(q.pop())
print(q.pop())
print(q.pop())
print(q.pop())
q.showQueue()