data_structures/queue/linked_queue.py · codenotsleep/Python

代码拉取完成,页面将自动刷新

扫描微信二维码支付

取消

支付完成

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 324

codenotsleep/Python

forked from 编程语言算法集/Python

代码 Issues 0 Pull Requests 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (76)

管理

master

fix-ruff

pipx-install-pre-commit-ruff

ruff-rule-ISC001

Re-enable-tests

Rename-is_palindrome.py-to-is_int_palindrome.py

Add-more-ruff-rules

pre-commit-ci-update-config

ruff

atbash.py-Tighten-up-the-benchmarks

prime_numbers.py-Tighten-up-the-benchmarks

dynamic_programming

maths/sum_of_digits.py-Streamline-benchmarks

maths/number_of_digits.py-Streamline-benchmarks

Python-3.11

7804-improve-the-maths-add-functionality-and-tests

7782-create-subtraction-method-in-maths-folder

quantum_random.py.DISABLED.txt

quantum_random.py.disabled

revert-7349-patch-4

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 76

标签 0

Python

data_structures

queue

linked_queue.py

linked_queue.py 3.62 KB

""" A Queue using a linked list like structure """
from __future__ import annotations

from collections.abc import Iterator
from typing import Any

class Node:
 def __init__(self, data: Any) -> None:
 self.data: Any = data
 self.next: Node | None = None

def __str__(self) -> str:
 return f"{self.data}"

class LinkedQueue:
 """
 >>> queue = LinkedQueue()
 >>> queue.is_empty()
 True
 >>> queue.put(5)
 >>> queue.put(9)
 >>> queue.put('python')
 >>> queue.is_empty()
 False
 >>> queue.get()
 5
 >>> queue.put('algorithms')
 >>> queue.get()
 9
 >>> queue.get()
 'python'
 >>> queue.get()
 'algorithms'
 >>> queue.is_empty()
 True
 >>> queue.get()
 Traceback (most recent call last):
 ...
 IndexError: dequeue from empty queue
 """

def __init__(self) -> None:
 self.front: Node | None = None
 self.rear: Node | None = None

def __iter__(self) -> Iterator[Any]:
 node = self.front
 while node:
 yield node.data
 node = node.next

def __len__(self) -> int:
 """
 >>> queue = LinkedQueue()
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> len(queue)
 5
 >>> for i in range(1, 6):
 ... assert len(queue) == 6 - i
 ... _ = queue.get()
 >>> len(queue)
 0
 """
 return len(tuple(iter(self)))

def __str__(self) -> str:
 """
 >>> queue = LinkedQueue()
 >>> for i in range(1, 4):
 ... queue.put(i)
 >>> queue.put("Python")
 >>> queue.put(3.14)
 >>> queue.put(True)
 >>> str(queue)
 '1 <- 2 <- 3 <- Python <- 3.14 <- True'
 """
 return " <- ".join(str(item) for item in self)

def is_empty(self) -> bool:
 """
 >>> queue = LinkedQueue()
 >>> queue.is_empty()
 True
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> queue.is_empty()
 False
 """
 return len(self) == 0

def put(self, item: Any) -> None:
 """
 >>> queue = LinkedQueue()
 >>> queue.get()
 Traceback (most recent call last):
 ...
 IndexError: dequeue from empty queue
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> str(queue)
 '1 <- 2 <- 3 <- 4 <- 5'
 """
 node = Node(item)
 if self.is_empty():
 self.front = self.rear = node
 else:
 assert isinstance(self.rear, Node)
 self.rear.next = node
 self.rear = node

def get(self) -> Any:
 """
 >>> queue = LinkedQueue()
 >>> queue.get()
 Traceback (most recent call last):
 ...
 IndexError: dequeue from empty queue
 >>> queue = LinkedQueue()
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> for i in range(1, 6):
 ... assert queue.get() == i
 >>> len(queue)
 0
 """
 if self.is_empty():
 raise IndexError("dequeue from empty queue")
 assert isinstance(self.front, Node)
 node = self.front
 self.front = self.front.next
 if self.front is None:
 self.rear = None
 return node.data

def clear(self) -> None:
 """
 >>> queue = LinkedQueue()
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> queue.clear()
 >>> len(queue)
 0
 >>> str(queue)
 ''
 """
 self.front = self.rear = None

if __name__ == "__main__":
 from doctest import testmod

testmod()

一键复制编辑原始数据按行查看历史

Caeden Perelli-Harris 提交于 2022年10月28日 01:42 +08:00 . refactor: Indent ... for visual purposes (#7744)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155

""" A Queue using a linked list like structure """
from __future__ import annotations

from collections.abc import Iterator
from typing import Any


class Node:
 def __init__(self, data: Any) -> None:
 self.data: Any = data
 self.next: Node | None = None

 def __str__(self) -> str:
 return f"{self.data}"


class LinkedQueue:
 """
 >>> queue = LinkedQueue()
 >>> queue.is_empty()
 True
 >>> queue.put(5)
 >>> queue.put(9)
 >>> queue.put('python')
 >>> queue.is_empty()
 False
 >>> queue.get()
 5
 >>> queue.put('algorithms')
 >>> queue.get()
 9
 >>> queue.get()
 'python'
 >>> queue.get()
 'algorithms'
 >>> queue.is_empty()
 True
 >>> queue.get()
 Traceback (most recent call last):
 ...
 IndexError: dequeue from empty queue
 """

 def __init__(self) -> None:
 self.front: Node | None = None
 self.rear: Node | None = None

 def __iter__(self) -> Iterator[Any]:
 node = self.front
 while node:
 yield node.data
 node = node.next

 def __len__(self) -> int:
 """
 >>> queue = LinkedQueue()
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> len(queue)
 5
 >>> for i in range(1, 6):
 ... assert len(queue) == 6 - i
 ... _ = queue.get()
 >>> len(queue)
 0
 """
 return len(tuple(iter(self)))

 def __str__(self) -> str:
 """
 >>> queue = LinkedQueue()
 >>> for i in range(1, 4):
 ... queue.put(i)
 >>> queue.put("Python")
 >>> queue.put(3.14)
 >>> queue.put(True)
 >>> str(queue)
 '1 <- 2 <- 3 <- Python <- 3.14 <- True'
 """
 return " <- ".join(str(item) for item in self)

 def is_empty(self) -> bool:
 """
 >>> queue = LinkedQueue()
 >>> queue.is_empty()
 True
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> queue.is_empty()
 False
 """
 return len(self) == 0

 def put(self, item: Any) -> None:
 """
 >>> queue = LinkedQueue()
 >>> queue.get()
 Traceback (most recent call last):
 ...
 IndexError: dequeue from empty queue
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> str(queue)
 '1 <- 2 <- 3 <- 4 <- 5'
 """
 node = Node(item)
 if self.is_empty():
 self.front = self.rear = node
 else:
 assert isinstance(self.rear, Node)
 self.rear.next = node
 self.rear = node

 def get(self) -> Any:
 """
 >>> queue = LinkedQueue()
 >>> queue.get()
 Traceback (most recent call last):
 ...
 IndexError: dequeue from empty queue
 >>> queue = LinkedQueue()
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> for i in range(1, 6):
 ... assert queue.get() == i
 >>> len(queue)
 0
 """
 if self.is_empty():
 raise IndexError("dequeue from empty queue")
 assert isinstance(self.front, Node)
 node = self.front
 self.front = self.front.next
 if self.front is None:
 self.rear = None
 return node.data

 def clear(self) -> None:
 """
 >>> queue = LinkedQueue()
 >>> for i in range(1, 6):
 ... queue.put(i)
 >>> queue.clear()
 >>> len(queue)
 0
 >>> str(queue)
 ''
 """
 self.front = self.rear = None


if __name__ == "__main__":
 from doctest import testmod

 testmod()