数据结构 | Python实现链表队列 | 源码和示例

python 复制代码
# Linked list node class
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

# Queue class
class Queue:
    def __init__(self):
        self.front = None  # Queue front
        self.rear = None  # Queue rear

    def is_empty(self):
        return self.front is None

    def enqueue(self, val):
        new_node = ListNode(val)
        if self.rear is None:
            self.front = self.rear = new_node
            return
        self.rear.next = new_node
        self.rear = new_node

    def dequeue(self):
        if self.is_empty():
            return "Queue is empty"
        val = self.front.val
        self.front = self.front.next
        if self.front is None:
            self.rear = None
        return val

    def peek(self):
        if self.is_empty():
            return "Queue is empty"
        return self.front.val

    def size(self):
        count = 0
        cur = self.front
        while cur:
            count += 1
            cur = cur.next
        return count

def main():
    # Create a new queue
    my_queue = Queue()

    # Check if the queue is empty
    print("Is the queue empty?", my_queue.is_empty())

    # Enqueue elements to the queue
    my_queue.enqueue(1)
    my_queue.enqueue(2)
    my_queue.enqueue(3)

    # Output the elements of the queue
    print("Queue elements:")
    cur = my_queue.front
    while cur:
        print(cur.val, end=" ")
        cur = cur.next
    print()

    # Check the size of the queue
    print("Queue size:", my_queue.size())

    # Peek at the front element of the queue
    print("Front element:", my_queue.peek())

    # Dequeue elements from the queue
    dequeued_item = my_queue.dequeue()
    print("Dequeued item:", dequeued_item)

    # Check the size of the queue after dequeue
    print("Queue size after dequeue:", my_queue.size())

    # Check if the queue is empty again
    print("Is the queue empty now?", my_queue.is_empty())

    # Output the elements of the queue
    print("Queue elements:")
    cur = my_queue.front
    while cur:
        print(cur.val, end=" ")
        cur = cur.next
    print()
    
if __name__ == "__main__":
    main()

结果:

Is the queue empty? True

Queue elements:

1 2 3

Queue size: 3

Front element: 1

Dequeued item: 1

Queue size after dequeue: 2

Is the queue empty now? False

Queue elements:

2 3

相关推荐
查理零世35 分钟前
【算法】回溯算法专题③ ——排列型回溯 python
python·算法·深度优先
利刃大大36 分钟前
【数据结构与算法】九大排序算法实现详解
c语言·数据结构·c++·算法·排序算法
眼镜哥(with glasses)39 分钟前
蓝桥杯python基础算法(2-1)——排序
数据结构·算法·蓝桥杯
Ethel L40 分钟前
Python - pyautogui库 模拟鼠标和键盘执行GUI任务
python
Dovis(誓平步青云)1 小时前
线性数据结构:单向链表
数据结构·链表
qystca2 小时前
【16届蓝桥杯寒假刷题营】第2期DAY2
数据结构·c++·算法·深度优先·二分·爆搜
游王子3 小时前
Python NumPy(6):修改数组形状、翻转数组、修改数组维度
开发语言·python·numpy
枫叶落雨2223 小时前
15JavaWeb——Maven高级篇
linux·python·maven
被AI抢饭碗的人4 小时前
算法题(56):旋转链表
数据结构·算法·链表
流形填表4 小时前
用FormLinker实现自动调整数据格式,批量导入微软表单
python·microsoft·flask