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
2025-11-02 12:58:42 +08:00 · 2024-04-06 02:30:11 +08:00
parent 33d7f8a2e5
commit 5f7385c8a3
1875 changed files with 102923 additions and 18 deletions
--- a/zh-hant/codes/python/modules/print_util.py
+++ b/zh-hant/codes/python/modules/print_util.py
@ -0,0 +1,81 @@
+"""
+File: print_util.py
+Created Time: 2021-12-11
+Author: krahets (krahets@163.com), msk397 (machangxinq@gmail.com)
+"""
+
+from .tree_node import TreeNode, list_to_tree
+from .list_node import ListNode, linked_list_to_list
+
+
+def print_matrix(mat: list[list[int]]):
+    """列印矩陣"""
+    s = []
+    for arr in mat:
+        s.append("  " + str(arr))
+    print("[\n" + ",\n".join(s) + "\n]")
+
+
+def print_linked_list(head: ListNode | None):
+    """列印鏈結串列"""
+    arr: list[int] = linked_list_to_list(head)
+    print(" -> ".join([str(a) for a in arr]))
+
+
+class Trunk:
+    def __init__(self, prev, string: str | None = None):
+        self.prev = prev
+        self.str = string
+
+
+def show_trunks(p: Trunk | None):
+    if p is None:
+        return
+    show_trunks(p.prev)
+    print(p.str, end="")
+
+
+def print_tree(
+    root: TreeNode | None, prev: Trunk | None = None, is_right: bool = False
+):
+    """
+    列印二元樹
+    This tree printer is borrowed from TECHIE DELIGHT
+    https://www.techiedelight.com/c-program-print-binary-tree/
+    """
+    if root is None:
+        return
+
+    prev_str = "    "
+    trunk = Trunk(prev, prev_str)
+    print_tree(root.right, trunk, True)
+
+    if prev is None:
+        trunk.str = "———"
+    elif is_right:
+        trunk.str = "/———"
+        prev_str = "   |"
+    else:
+        trunk.str = "\———"
+        prev.str = prev_str
+
+    show_trunks(trunk)
+    print(" " + str(root.val))
+    if prev:
+        prev.str = prev_str
+    trunk.str = "   |"
+    print_tree(root.left, trunk, False)
+
+
+def print_dict(hmap: dict):
+    """列印字典"""
+    for key, value in hmap.items():
+        print(key, "->", value)
+
+
+def print_heap(heap: list[int]):
+    """列印堆積"""
+    print("堆積的陣列表示：", heap)
+    print("堆積的樹狀表示：")
+    root: TreeNode | None = list_to_tree(heap)
+    print_tree(root)