mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-08 21:32:15 +08:00
feat: Traditional Chinese version (#1163)
* First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology. * Update terminology * 构造函数/构造方法 -> 建構子 异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統 斐波那契數列 -> 費波那契數列 運算元量 -> 運算量 引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向 歸併排序 -> 合併排序 范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示 反碼 -> 一補數 補碼 -> 二補數 列列尾部 -> 佇列尾部 區域性性 -> 區域性 一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號 推匯 -> 推導 * Sync with main branch * First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology * 构造函数/构造方法 -> 建構子 异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統 斐波那契數列 -> 費波那契數列 運算元量 -> 運算量 引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向 歸併排序 -> 合併排序 范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示 反碼 -> 一補數 補碼 -> 二補數 列列尾部 -> 佇列尾部 區域性性 -> 區域性 一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號 推匯 -> 推導 * Sync with main branch * Update terminology.md * 操作数量（num. of operations）-> 操作數量 * 字首和->前綴和 * Update figures * 歸 -> 迴 記憶體洩漏 -> 記憶體流失 * Fix the bug of the file filter * 支援 -> 支持 Add zh-Hant/README.md * Add the zh-Hant chapter covers. Bug fixes. * 外掛 -> 擴充功能 * Add the landing page for zh-Hant version * Unify the font of the chapter covers for the zh, en, and zh-Hant version * Move zh-Hant/ to zh-hant/ * Translate terminology.md to traditional Chinese
This commit is contained in:
Yudong Jin
129
zh-hant/codes/python/chapter_stack_and_queue/array_deque.py
Normal file
129
zh-hant/codes/python/chapter_stack_and_queue/array_deque.py
Normal file
@@ -0,0 +1,129 @@
|
||||
"""
|
||||
File: array_deque.py
|
||||
Created Time: 2023-03-01
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
|
||||
class ArrayDeque:
|
||||
"""基於環形陣列實現的雙向佇列"""
|
||||
|
||||
def __init__(self, capacity: int):
|
||||
"""建構子"""
|
||||
self._nums: list[int] = [0] * capacity
|
||||
self._front: int = 0
|
||||
self._size: int = 0
|
||||
|
||||
def capacity(self) -> int:
|
||||
"""獲取雙向佇列的容量"""
|
||||
return len(self._nums)
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取雙向佇列的長度"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判斷雙向佇列是否為空"""
|
||||
return self._size == 0
|
||||
|
||||
def index(self, i: int) -> int:
|
||||
"""計算環形陣列索引"""
|
||||
# 透過取餘操作實現陣列首尾相連
|
||||
# 當 i 越過陣列尾部後，回到頭部
|
||||
# 當 i 越過陣列頭部後，回到尾部
|
||||
return (i + self.capacity()) % self.capacity()
|
||||
|
||||
def push_first(self, num: int):
|
||||
"""佇列首入列"""
|
||||
if self._size == self.capacity():
|
||||
print("雙向佇列已滿")
|
||||
return
|
||||
# 佇列首指標向左移動一位
|
||||
# 透過取餘操作實現 front 越過陣列頭部後回到尾部
|
||||
self._front = self.index(self._front - 1)
|
||||
# 將 num 新增至佇列首
|
||||
self._nums[self._front] = num
|
||||
self._size += 1
|
||||
|
||||
def push_last(self, num: int):
|
||||
"""佇列尾入列"""
|
||||
if self._size == self.capacity():
|
||||
print("雙向佇列已滿")
|
||||
return
|
||||
# 計算佇列尾指標，指向佇列尾索引 + 1
|
||||
rear = self.index(self._front + self._size)
|
||||
# 將 num 新增至佇列尾
|
||||
self._nums[rear] = num
|
||||
self._size += 1
|
||||
|
||||
def pop_first(self) -> int:
|
||||
"""佇列首出列"""
|
||||
num = self.peek_first()
|
||||
# 佇列首指標向後移動一位
|
||||
self._front = self.index(self._front + 1)
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def pop_last(self) -> int:
|
||||
"""佇列尾出列"""
|
||||
num = self.peek_last()
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek_first(self) -> int:
|
||||
"""訪問佇列首元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("雙向佇列為空")
|
||||
return self._nums[self._front]
|
||||
|
||||
def peek_last(self) -> int:
|
||||
"""訪問佇列尾元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("雙向佇列為空")
|
||||
# 計算尾元素索引
|
||||
last = self.index(self._front + self._size - 1)
|
||||
return self._nums[last]
|
||||
|
||||
def to_array(self) -> list[int]:
|
||||
"""返回陣列用於列印"""
|
||||
# 僅轉換有效長度範圍內的串列元素
|
||||
res = []
|
||||
for i in range(self._size):
|
||||
res.append(self._nums[self.index(self._front + i)])
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化雙向佇列
|
||||
deque = ArrayDeque(10)
|
||||
deque.push_last(3)
|
||||
deque.push_last(2)
|
||||
deque.push_last(5)
|
||||
print("雙向佇列 deque =", deque.to_array())
|
||||
|
||||
# 訪問元素
|
||||
peek_first: int = deque.peek_first()
|
||||
print("佇列首元素 peek_first =", peek_first)
|
||||
peek_last: int = deque.peek_last()
|
||||
print("佇列尾元素 peek_last =", peek_last)
|
||||
|
||||
# 元素入列
|
||||
deque.push_last(4)
|
||||
print("元素 4 佇列尾入列後 deque =", deque.to_array())
|
||||
deque.push_first(1)
|
||||
print("元素 1 佇列首入列後 deque =", deque.to_array())
|
||||
|
||||
# 元素出列
|
||||
pop_last: int = deque.pop_last()
|
||||
print("佇列尾出列元素 =", pop_last, "，佇列尾出列後 deque =", deque.to_array())
|
||||
pop_first: int = deque.pop_first()
|
||||
print("佇列首出列元素 =", pop_first, "，佇列首出列後 deque =", deque.to_array())
|
||||
|
||||
# 獲取雙向佇列的長度
|
||||
size: int = deque.size()
|
||||
print("雙向佇列長度 size =", size)
|
||||
|
||||
# 判斷雙向佇列是否為空
|
||||
is_empty: bool = deque.is_empty()
|
||||
print("雙向佇列是否為空 =", is_empty)
|
||||
98
zh-hant/codes/python/chapter_stack_and_queue/array_queue.py
Normal file
98
zh-hant/codes/python/chapter_stack_and_queue/array_queue.py
Normal file
@@ -0,0 +1,98 @@
|
||||
"""
|
||||
File: array_queue.py
|
||||
Created Time: 2022-12-01
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
|
||||
class ArrayQueue:
|
||||
"""基於環形陣列實現的佇列"""
|
||||
|
||||
def __init__(self, size: int):
|
||||
"""建構子"""
|
||||
self._nums: list[int] = [0] * size # 用於儲存佇列元素的陣列
|
||||
self._front: int = 0 # 佇列首指標，指向佇列首元素
|
||||
self._size: int = 0 # 佇列長度
|
||||
|
||||
def capacity(self) -> int:
|
||||
"""獲取佇列的容量"""
|
||||
return len(self._nums)
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取佇列的長度"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判斷佇列是否為空"""
|
||||
return self._size == 0
|
||||
|
||||
def push(self, num: int):
|
||||
"""入列"""
|
||||
if self._size == self.capacity():
|
||||
raise IndexError("佇列已滿")
|
||||
# 計算佇列尾指標，指向佇列尾索引 + 1
|
||||
# 透過取餘操作實現 rear 越過陣列尾部後回到頭部
|
||||
rear: int = (self._front + self._size) % self.capacity()
|
||||
# 將 num 新增至佇列尾
|
||||
self._nums[rear] = num
|
||||
self._size += 1
|
||||
|
||||
def pop(self) -> int:
|
||||
"""出列"""
|
||||
num: int = self.peek()
|
||||
# 佇列首指標向後移動一位，若越過尾部，則返回到陣列頭部
|
||||
self._front = (self._front + 1) % self.capacity()
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek(self) -> int:
|
||||
"""訪問佇列首元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("佇列為空")
|
||||
return self._nums[self._front]
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""返回串列用於列印"""
|
||||
res = [0] * self.size()
|
||||
j: int = self._front
|
||||
for i in range(self.size()):
|
||||
res[i] = self._nums[(j % self.capacity())]
|
||||
j += 1
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化佇列
|
||||
queue = ArrayQueue(10)
|
||||
|
||||
# 元素入列
|
||||
queue.push(1)
|
||||
queue.push(3)
|
||||
queue.push(2)
|
||||
queue.push(5)
|
||||
queue.push(4)
|
||||
print("佇列 queue =", queue.to_list())
|
||||
|
||||
# 訪問佇列首元素
|
||||
peek: int = queue.peek()
|
||||
print("佇列首元素 peek =", peek)
|
||||
|
||||
# 元素出列
|
||||
pop: int = queue.pop()
|
||||
print("出列元素 pop =", pop)
|
||||
print("出列後 queue =", queue.to_list())
|
||||
|
||||
# 獲取佇列的長度
|
||||
size: int = queue.size()
|
||||
print("佇列長度 size =", size)
|
||||
|
||||
# 判斷佇列是否為空
|
||||
is_empty: bool = queue.is_empty()
|
||||
print("佇列是否為空 =", is_empty)
|
||||
|
||||
# 測試環形陣列
|
||||
for i in range(10):
|
||||
queue.push(i)
|
||||
queue.pop()
|
||||
print("第", i, "輪入列 + 出列後 queue = ", queue.to_list())
|
||||
72
zh-hant/codes/python/chapter_stack_and_queue/array_stack.py
Normal file
72
zh-hant/codes/python/chapter_stack_and_queue/array_stack.py
Normal file
@@ -0,0 +1,72 @@
|
||||
"""
|
||||
File: array_stack.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
|
||||
class ArrayStack:
|
||||
"""基於陣列實現的堆疊"""
|
||||
|
||||
def __init__(self):
|
||||
"""建構子"""
|
||||
self._stack: list[int] = []
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取堆疊的長度"""
|
||||
return len(self._stack)
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判斷堆疊是否為空"""
|
||||
return self._stack == []
|
||||
|
||||
def push(self, item: int):
|
||||
"""入堆疊"""
|
||||
self._stack.append(item)
|
||||
|
||||
def pop(self) -> int:
|
||||
"""出堆疊"""
|
||||
if self.is_empty():
|
||||
raise IndexError("堆疊為空")
|
||||
return self._stack.pop()
|
||||
|
||||
def peek(self) -> int:
|
||||
"""訪問堆疊頂元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("堆疊為空")
|
||||
return self._stack[-1]
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""返回串列用於列印"""
|
||||
return self._stack
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化堆疊
|
||||
stack = ArrayStack()
|
||||
|
||||
# 元素入堆疊
|
||||
stack.push(1)
|
||||
stack.push(3)
|
||||
stack.push(2)
|
||||
stack.push(5)
|
||||
stack.push(4)
|
||||
print("堆疊 stack =", stack.to_list())
|
||||
|
||||
# 訪問堆疊頂元素
|
||||
peek: int = stack.peek()
|
||||
print("堆疊頂元素 peek =", peek)
|
||||
|
||||
# 元素出堆疊
|
||||
pop: int = stack.pop()
|
||||
print("出堆疊元素 pop =", pop)
|
||||
print("出堆疊後 stack =", stack.to_list())
|
||||
|
||||
# 獲取堆疊的長度
|
||||
size: int = stack.size()
|
||||
print("堆疊的長度 size =", size)
|
||||
|
||||
# 判斷是否為空
|
||||
is_empty: bool = stack.is_empty()
|
||||
print("堆疊是否為空 =", is_empty)
|
||||
42
zh-hant/codes/python/chapter_stack_and_queue/deque.py
Normal file
42
zh-hant/codes/python/chapter_stack_and_queue/deque.py
Normal file
@@ -0,0 +1,42 @@
|
||||
"""
|
||||
File: deque.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
from collections import deque
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化雙向佇列
|
||||
deq: deque[int] = deque()
|
||||
|
||||
# 元素入列
|
||||
deq.append(2) # 新增至佇列尾
|
||||
deq.append(5)
|
||||
deq.append(4)
|
||||
deq.appendleft(3) # 新增至佇列首
|
||||
deq.appendleft(1)
|
||||
print("雙向佇列 deque =", deq)
|
||||
|
||||
# 訪問元素
|
||||
front: int = deq[0] # 佇列首元素
|
||||
print("佇列首元素 front =", front)
|
||||
rear: int = deq[-1] # 佇列尾元素
|
||||
print("佇列尾元素 rear =", rear)
|
||||
|
||||
# 元素出列
|
||||
pop_front: int = deq.popleft() # 佇列首元素出列
|
||||
print("佇列首出列元素 pop_front =", pop_front)
|
||||
print("佇列首出列後 deque =", deq)
|
||||
pop_rear: int = deq.pop() # 佇列尾元素出列
|
||||
print("佇列尾出列元素 pop_rear =", pop_rear)
|
||||
print("佇列尾出列後 deque =", deq)
|
||||
|
||||
# 獲取雙向佇列的長度
|
||||
size: int = len(deq)
|
||||
print("雙向佇列長度 size =", size)
|
||||
|
||||
# 判斷雙向佇列是否為空
|
||||
is_empty: bool = len(deq) == 0
|
||||
print("雙向佇列是否為空 =", is_empty)
|
||||
151
zh-hant/codes/python/chapter_stack_and_queue/linkedlist_deque.py
Normal file
151
zh-hant/codes/python/chapter_stack_and_queue/linkedlist_deque.py
Normal file
@@ -0,0 +1,151 @@
|
||||
"""
|
||||
File: linkedlist_deque.py
|
||||
Created Time: 2023-03-01
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
|
||||
class ListNode:
|
||||
"""雙向鏈結串列節點"""
|
||||
|
||||
def __init__(self, val: int):
|
||||
"""建構子"""
|
||||
self.val: int = val
|
||||
self.next: ListNode | None = None # 後繼節點引用
|
||||
self.prev: ListNode | None = None # 前驅節點引用
|
||||
|
||||
|
||||
class LinkedListDeque:
|
||||
"""基於雙向鏈結串列實現的雙向佇列"""
|
||||
|
||||
def __init__(self):
|
||||
"""建構子"""
|
||||
self._front: ListNode | None = None # 頭節點 front
|
||||
self._rear: ListNode | None = None # 尾節點 rear
|
||||
self._size: int = 0 # 雙向佇列的長度
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取雙向佇列的長度"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判斷雙向佇列是否為空"""
|
||||
return self.size() == 0
|
||||
|
||||
def push(self, num: int, is_front: bool):
|
||||
"""入列操作"""
|
||||
node = ListNode(num)
|
||||
# 若鏈結串列為空，則令 front 和 rear 都指向 node
|
||||
if self.is_empty():
|
||||
self._front = self._rear = node
|
||||
# 佇列首入列操作
|
||||
elif is_front:
|
||||
# 將 node 新增至鏈結串列頭部
|
||||
self._front.prev = node
|
||||
node.next = self._front
|
||||
self._front = node # 更新頭節點
|
||||
# 佇列尾入列操作
|
||||
else:
|
||||
# 將 node 新增至鏈結串列尾部
|
||||
self._rear.next = node
|
||||
node.prev = self._rear
|
||||
self._rear = node # 更新尾節點
|
||||
self._size += 1 # 更新佇列長度
|
||||
|
||||
def push_first(self, num: int):
|
||||
"""佇列首入列"""
|
||||
self.push(num, True)
|
||||
|
||||
def push_last(self, num: int):
|
||||
"""佇列尾入列"""
|
||||
self.push(num, False)
|
||||
|
||||
def pop(self, is_front: bool) -> int:
|
||||
"""出列操作"""
|
||||
if self.is_empty():
|
||||
raise IndexError("雙向佇列為空")
|
||||
# 佇列首出列操作
|
||||
if is_front:
|
||||
val: int = self._front.val # 暫存頭節點值
|
||||
# 刪除頭節點
|
||||
fnext: ListNode | None = self._front.next
|
||||
if fnext != None:
|
||||
fnext.prev = None
|
||||
self._front.next = None
|
||||
self._front = fnext # 更新頭節點
|
||||
# 佇列尾出列操作
|
||||
else:
|
||||
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._size -= 1 # 更新佇列長度
|
||||
return val
|
||||
|
||||
def pop_first(self) -> int:
|
||||
"""佇列首出列"""
|
||||
return self.pop(True)
|
||||
|
||||
def pop_last(self) -> int:
|
||||
"""佇列尾出列"""
|
||||
return self.pop(False)
|
||||
|
||||
def peek_first(self) -> int:
|
||||
"""訪問佇列首元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("雙向佇列為空")
|
||||
return self._front.val
|
||||
|
||||
def peek_last(self) -> int:
|
||||
"""訪問佇列尾元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("雙向佇列為空")
|
||||
return self._rear.val
|
||||
|
||||
def to_array(self) -> list[int]:
|
||||
"""返回陣列用於列印"""
|
||||
node = self._front
|
||||
res = [0] * self.size()
|
||||
for i in range(self.size()):
|
||||
res[i] = node.val
|
||||
node = node.next
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化雙向佇列
|
||||
deque = LinkedListDeque()
|
||||
deque.push_last(3)
|
||||
deque.push_last(2)
|
||||
deque.push_last(5)
|
||||
print("雙向佇列 deque =", deque.to_array())
|
||||
|
||||
# 訪問元素
|
||||
peek_first: int = deque.peek_first()
|
||||
print("佇列首元素 peek_first =", peek_first)
|
||||
peek_last: int = deque.peek_last()
|
||||
print("佇列尾元素 peek_last =", peek_last)
|
||||
|
||||
# 元素入列
|
||||
deque.push_last(4)
|
||||
print("元素 4 佇列尾入列後 deque =", deque.to_array())
|
||||
deque.push_first(1)
|
||||
print("元素 1 佇列首入列後 deque =", deque.to_array())
|
||||
|
||||
# 元素出列
|
||||
pop_last: int = deque.pop_last()
|
||||
print("佇列尾出列元素 =", pop_last, "，佇列尾出列後 deque =", deque.to_array())
|
||||
pop_first: int = deque.pop_first()
|
||||
print("佇列首出列元素 =", pop_first, "，佇列首出列後 deque =", deque.to_array())
|
||||
|
||||
# 獲取雙向佇列的長度
|
||||
size: int = deque.size()
|
||||
print("雙向佇列長度 size =", size)
|
||||
|
||||
# 判斷雙向佇列是否為空
|
||||
is_empty: bool = deque.is_empty()
|
||||
print("雙向佇列是否為空 =", is_empty)
|
||||
@@ -0,0 +1,97 @@
|
||||
"""
|
||||
File: linkedlist_queue.py
|
||||
Created Time: 2022-12-01
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import ListNode
|
||||
|
||||
|
||||
class LinkedListQueue:
|
||||
"""基於鏈結串列實現的佇列"""
|
||||
|
||||
def __init__(self):
|
||||
"""建構子"""
|
||||
self._front: ListNode | None = None # 頭節點 front
|
||||
self._rear: ListNode | None = None # 尾節點 rear
|
||||
self._size: int = 0
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取佇列的長度"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判斷佇列是否為空"""
|
||||
return not self._front
|
||||
|
||||
def push(self, num: int):
|
||||
"""入列"""
|
||||
# 在尾節點後新增 num
|
||||
node = ListNode(num)
|
||||
# 如果佇列為空，則令頭、尾節點都指向該節點
|
||||
if self._front is None:
|
||||
self._front = node
|
||||
self._rear = node
|
||||
# 如果佇列不為空，則將該節點新增到尾節點後
|
||||
else:
|
||||
self._rear.next = node
|
||||
self._rear = node
|
||||
self._size += 1
|
||||
|
||||
def pop(self) -> int:
|
||||
"""出列"""
|
||||
num = self.peek()
|
||||
# 刪除頭節點
|
||||
self._front = self._front.next
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek(self) -> int:
|
||||
"""訪問佇列首元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("佇列為空")
|
||||
return self._front.val
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""轉化為串列用於列印"""
|
||||
queue = []
|
||||
temp = self._front
|
||||
while temp:
|
||||
queue.append(temp.val)
|
||||
temp = temp.next
|
||||
return queue
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化佇列
|
||||
queue = LinkedListQueue()
|
||||
|
||||
# 元素入列
|
||||
queue.push(1)
|
||||
queue.push(3)
|
||||
queue.push(2)
|
||||
queue.push(5)
|
||||
queue.push(4)
|
||||
print("佇列 queue =", queue.to_list())
|
||||
|
||||
# 訪問佇列首元素
|
||||
peek: int = queue.peek()
|
||||
print("佇列首元素 front =", peek)
|
||||
|
||||
# 元素出列
|
||||
pop_front: int = queue.pop()
|
||||
print("出列元素 pop =", pop_front)
|
||||
print("出列後 queue =", queue.to_list())
|
||||
|
||||
# 獲取佇列的長度
|
||||
size: int = queue.size()
|
||||
print("佇列長度 size =", size)
|
||||
|
||||
# 判斷佇列是否為空
|
||||
is_empty: bool = queue.is_empty()
|
||||
print("佇列是否為空 =", is_empty)
|
||||
@@ -0,0 +1,89 @@
|
||||
"""
|
||||
File: linkedlist_stack.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import ListNode
|
||||
|
||||
|
||||
class LinkedListStack:
|
||||
"""基於鏈結串列實現的堆疊"""
|
||||
|
||||
def __init__(self):
|
||||
"""建構子"""
|
||||
self._peek: ListNode | None = None
|
||||
self._size: int = 0
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取堆疊的長度"""
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判斷堆疊是否為空"""
|
||||
return not self._peek
|
||||
|
||||
def push(self, val: int):
|
||||
"""入堆疊"""
|
||||
node = ListNode(val)
|
||||
node.next = self._peek
|
||||
self._peek = node
|
||||
self._size += 1
|
||||
|
||||
def pop(self) -> int:
|
||||
"""出堆疊"""
|
||||
num = self.peek()
|
||||
self._peek = self._peek.next
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek(self) -> int:
|
||||
"""訪問堆疊頂元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("堆疊為空")
|
||||
return self._peek.val
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""轉化為串列用於列印"""
|
||||
arr = []
|
||||
node = self._peek
|
||||
while node:
|
||||
arr.append(node.val)
|
||||
node = node.next
|
||||
arr.reverse()
|
||||
return arr
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化堆疊
|
||||
stack = LinkedListStack()
|
||||
|
||||
# 元素入堆疊
|
||||
stack.push(1)
|
||||
stack.push(3)
|
||||
stack.push(2)
|
||||
stack.push(5)
|
||||
stack.push(4)
|
||||
print("堆疊 stack =", stack.to_list())
|
||||
|
||||
# 訪問堆疊頂元素
|
||||
peek: int = stack.peek()
|
||||
print("堆疊頂元素 peek =", peek)
|
||||
|
||||
# 元素出堆疊
|
||||
pop: int = stack.pop()
|
||||
print("出堆疊元素 pop =", pop)
|
||||
print("出堆疊後 stack =", stack.to_list())
|
||||
|
||||
# 獲取堆疊的長度
|
||||
size: int = stack.size()
|
||||
print("堆疊的長度 size =", size)
|
||||
|
||||
# 判斷是否為空
|
||||
is_empty: bool = stack.is_empty()
|
||||
print("堆疊是否為空 =", is_empty)
|
||||
39
zh-hant/codes/python/chapter_stack_and_queue/queue.py
Normal file
39
zh-hant/codes/python/chapter_stack_and_queue/queue.py
Normal file
@@ -0,0 +1,39 @@
|
||||
"""
|
||||
File: queue.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
from collections import deque
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化佇列
|
||||
# 在 Python 中，我們一般將雙向佇列類別 deque 看作佇列使用
|
||||
# 雖然 queue.Queue() 是純正的佇列類別，但不太好用
|
||||
que: deque[int] = deque()
|
||||
|
||||
# 元素入列
|
||||
que.append(1)
|
||||
que.append(3)
|
||||
que.append(2)
|
||||
que.append(5)
|
||||
que.append(4)
|
||||
print("佇列 que =", que)
|
||||
|
||||
# 訪問佇列首元素
|
||||
front: int = que[0]
|
||||
print("佇列首元素 front =", front)
|
||||
|
||||
# 元素出列
|
||||
pop: int = que.popleft()
|
||||
print("出列元素 pop =", pop)
|
||||
print("出列後 que =", que)
|
||||
|
||||
# 獲取佇列的長度
|
||||
size: int = len(que)
|
||||
print("佇列長度 size =", size)
|
||||
|
||||
# 判斷佇列是否為空
|
||||
is_empty: bool = len(que) == 0
|
||||
print("佇列是否為空 =", is_empty)
|
||||
36
zh-hant/codes/python/chapter_stack_and_queue/stack.py
Normal file
36
zh-hant/codes/python/chapter_stack_and_queue/stack.py
Normal file
@@ -0,0 +1,36 @@
|
||||
"""
|
||||
File: stack.py
|
||||
Created Time: 2022-11-29
|
||||
Author: Peng Chen (pengchzn@gmail.com)
|
||||
"""
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化堆疊
|
||||
# Python 沒有內建的堆疊類別，可以把 list 當作堆疊來使用
|
||||
stack: list[int] = []
|
||||
|
||||
# 元素入堆疊
|
||||
stack.append(1)
|
||||
stack.append(3)
|
||||
stack.append(2)
|
||||
stack.append(5)
|
||||
stack.append(4)
|
||||
print("堆疊 stack =", stack)
|
||||
|
||||
# 訪問堆疊頂元素
|
||||
peek: int = stack[-1]
|
||||
print("堆疊頂元素 peek =", peek)
|
||||
|
||||
# 元素出堆疊
|
||||
pop: int = stack.pop()
|
||||
print("出堆疊元素 pop =", pop)
|
||||
print("出堆疊後 stack =", stack)
|
||||
|
||||
# 獲取堆疊的長度
|
||||
size: int = len(stack)
|
||||
print("堆疊的長度 size =", size)
|
||||
|
||||
# 判斷是否為空
|
||||
is_empty: bool = len(stack) == 0
|
||||
print("堆疊是否為空 =", is_empty)
|
||||
Reference in New Issue
Block a user