队列和队列的内置模块

队列

# 队列：先进先出    队首（front）进行出队（front + 1），队尾（rear）进行入队（rear + 1）
# 环形队列：当队尾指针rear == maxsize -1时，再前进一个位置就自动到0
"""
环形队列
1、队首指针前进1：front = （front + 1）% maxsize
2、队尾指针前进1：rear = （rear + 1）% maxsize
3、队空条件：rear == front
4、队满条件：（rear + 1）% maxsize == front
"""


class Queue:
    def __init__(self, size=100):
        self.queue = [0 for _ in range(size)]
        self.rear = 0  # 队尾指针
        self.front = 0  # 队首指针
        self.size = size

    def push(self, element):
        if not self.is_filled():
            self.rear = (self.rear + 1) % self.size   # 队尾指针前进1
            self.queue[self.rear] = element
        else:
            raise IndexError("Queue is filled.")

    def pop(self):
        if not self.is_empty():
            self.front = (self.front + 1) % self.size  # 队首指针前进1
            return self.queue[self.front]
        else:
            raise IndexError("Queue is empty.")

    # 判断队空
    def is_empty(self):
        return self.front == self.rear

    # 判断队满
    def is_filled(self):
        return (self.rear + 1) % self.size == self.front


q = Queue(5)
for i in range(4):
    q.push(i)
print(q.is_filled())
print(q.pop())

队列的内置模块

# 双向队列：两端都支持进队和出队操作

from collections import deque


# q = deque([1, 2, 3])
# print(q)
# q.append(4)  # 队尾进队
# print(q.popleft())  # 队首出队
#
# # 用于双向队列
# q.appendleft(1)  # 队首进队
# print(q)
# print(q.pop())  # 队尾出队
def tail(n):
    with open('text.txt', 'r') as f:
        q = deque(f, n)
        return q


for line in tail(5):
    print(line, end='')