CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-03 10:53:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
codes/python/chapter_stack_and_queue/linkedlist_deque.py
View File

@@ -5,19 +5,19 @@ Author: Krahets (krahets@163.com)
"""
class ListNode:
""" 双向链表结点 """
""" 双向链表节点 """
def __init__(self, val: int) -> None:
""" 构造方法 """
self.val: int = val
self.next: ListNode | None = None # 后继结点引用（指针）
self.prev: ListNode | None = None # 前驱结点引用（指针）
self.next: ListNode | None = None # 后继节点引用（指针）
self.prev: ListNode | None = None # 前驱节点引用（指针）
class LinkedListDeque:
""" 基于双向链表实现的双向队列 """
def __init__(self) -> None:
""" 构造方法 """
self.front: ListNode | None = None # 头结点 front
self.rear: ListNode | None = None # 尾结点 rear
self.front: ListNode | None = None # 头节点 front
self.rear: ListNode | None = None # 尾节点 rear
self.__size: int = 0 # 双向队列的长度
def size(self) -> int:
@@ -39,13 +39,13 @@ class LinkedListDeque:
# 将 node 添加至链表头部
self.front.prev = node
node.next = self.front
self.front = node # 更新头结点
self.front = node # 更新头节点
# 队尾入队操作
else:
# 将 node 添加至链表尾部
self.rear.next = node
node.prev = self.rear
self.rear = node # 更新尾结点
self.rear = node # 更新尾节点
self.__size += 1 # 更新队列长度
def push_first(self, num: int) -> None:
@@ -63,22 +63,22 @@ class LinkedListDeque:
return None
# 队首出队操作
if is_front:
val: int = self.front.val # 暂存头结点值
# 删除头结点
val: int = self.front.val # 暂存头节点值
# 删除头节点
fnext: ListNode | None = self.front.next
if fnext != None:
fnext.prev = None
self.front.next = None
self.front = fnext # 更新头结点
self.front = fnext # 更新头节点
# 队尾出队操作
else:
val: int = self.rear.val # 暂存尾结点值
# 删除尾结点
val: int = self.rear.val # 暂存尾节点值
# 删除尾节点
rprev: ListNode | None = self.rear.prev
if rprev != None:
rprev.next = None
self.rear.prev = None
self.rear = rprev # 更新尾结点
self.rear = rprev # 更新尾节点
self.__size -= 1 # 更新队列长度
return val

12
codes/python/chapter_stack_and_queue/linkedlist_queue.py
View File

@@ -12,8 +12,8 @@ class LinkedListQueue:
""" 基于链表实现的队列 """
def __init__(self):
""" 构造方法 """
self.__front: ListNode | None = None # 头结点 front
self.__rear: ListNode | None = None # 尾结点 rear
self.__front: ListNode | None = None # 头节点 front
self.__rear: ListNode | None = None # 尾节点 rear
self.__size: int = 0
def size(self) -> int:
@@ -26,13 +26,13 @@ class LinkedListQueue:
def push(self, num: int) -> None:
""" 入队 """
# 尾结点后添加 num
# 尾节点后添加 num
node = ListNode(num)
# 如果队列为空，则令头、尾结点都指向该结点
# 如果队列为空，则令头、尾节点都指向该节点
if self.__front is None:
self.__front = node
self.__rear = node
# 如果队列不为空，则将该结点添加到尾结点后
# 如果队列不为空，则将该节点添加到尾节点后
else:
self.__rear.next = node
self.__rear = node
@@ -41,7 +41,7 @@ class LinkedListQueue:
def pop(self) -> int:
""" 出队 """
num = self.peek()
# 删除头结点
# 删除头节点
self.__front = self.__front.next
self.__size -= 1
return num