用Python实现队列---2链表

代码

class Node:
    def __init__(self, data, _next=None):
        self.data = data  # 数据域
        self.next = _next  # 指针域


class Queue:
    def __init__(self):
        self.head = None  # 队头
        self.rear = None  # 队尾
        self._length = 0  # 队列长度

    def is_empty(self):
        return self._length == 0

    def length(self):
        return self._length

    def push(self, item):
        node = Node(item)
        # 如果队列为空
        if self.is_empty():  # head 和rear都指向第一个结点
            self.head = node
            self.rear = node
        else:
            self.rear.next = node
            self.rear = node
        self._length += 1

    def pop(self):
        # 抛出队首元素 head从指向第一个节点变为指向第二个结点
        if self.is_empty():
            raise ValueError("队列为空")
        value = self.head.data
        self.head = self.head.next
        self._length -= 1
        return value

    def peek(self):
        if self.is_empty():
            raise ValueError("队列为空")
        return self.head.data


if __name__ == "__main__":
    queue = Queue()
    queue.push(1)  # 进入队列
    queue.push(2)
    queue.push(3)
    queue.push(4)
    print(queue.length())  # 队列长度
    print(queue.peek())  # 队头元素
    print(queue.pop())  # 出队
    print(queue.pop())
    print(queue.pop())
    print(queue.pop())
    # print(queue.pop())

结果