队列:
队列是一个数据集合,仅允许在列表的一端进行插入,在另一端进行删除;
进行插入的一端:队尾(rear),插入动作称为进队or入队
进行删除的一端:队头(front),删除动作称为出队
队的性质:先进先出(FIFO)
环形队列:
当队尾指针front == MaxSize +1 时,再前进一个位置就自动到0;
队首指针前进1: front = (front + 1)% MaxSize
队尾指针前进1:rear = (rear +1) % MaxSize
队空条件:rear == front
队满条件:(rear + 1) %MaxSize == front
代码实现:
class Queue():
def __init__(self ,size = 100):
self.queue = [0] * size
self.size = size
self.rear = 0
self.front = 0
def __str__(self):
return self.queue
def push(self,element):
if not self.is_fill():
self.rear = (self.rear +1 )%self.size
self.queue[self.rear] = element
else:
print('Queue is fill')
def pop(self):
if not self.is_empty():
self.front = (self.front +1 )% self.size
return self.queue[self.front]
else:
print("Queue is empty")
def is_empty(self):
return self.rear == self.front
def is_fill(self):
return (self.rear+1 )%self.size == self.front
q = Queue(5)
for i in range(4):
q.push(i)
print(q.pop())