一、循环队列
比n(长度)要少存放一个数据
当队满时,(tail+1)%n=head
CircleQueue.py
class CircleQueue: def __init__(self,n): self.n=n self.numList=[] self.head=0 self.tail=0 def push(self,num): if (self.tail+1)%self.n==self.head: return False else: self.numList.append(num) self.tail=(self.tail+1)%self.n def pop(self): if self.head==self.tail: return False else: num =self.numList[self.head] self.head = (self.head + 1) % self.n return num def itor(self): if self.head<self.tail: for i in range(self.head,self.tail):