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
2026-07-09 14:06:06 +00:00 · 2024-04-06 02:30:11 +08:00
parent 33d7f8a2e5
commit 5f7385c8a3
1875 changed files with 102923 additions and 18 deletions
@@ -0,0 +1,19 @@
+# Follow the PEP 585 - Type Hinting Generics In Standard Collections
+# https://peps.python.org/pep-0585/
+from __future__ import annotations
+
+# Import common libs here to simplify the code by `from module import *`
+from .list_node import (
+    ListNode,
+    list_to_linked_list,
+    linked_list_to_list,
+)
+from .tree_node import TreeNode, list_to_tree, tree_to_list
+from .vertex import Vertex, vals_to_vets, vets_to_vals
+from .print_util import (
+    print_matrix,
+    print_linked_list,
+    print_tree,
+    print_dict,
+    print_heap,
+)
@@ -0,0 +1,32 @@
+"""
+File: list_node.py
+Created Time: 2021-12-11
+Author: krahets (krahets@163.com)
+"""
+
+
+class ListNode:
+    """鏈結串列節點類別"""
+
+    def __init__(self, val: int):
+        self.val: int = val  # 節點值
+        self.next: ListNode | None = None  # 後繼節點引用
+
+
+def list_to_linked_list(arr: list[int]) -> ListNode | None:
+    """將串列反序列化為鏈結串列"""
+    dum = head = ListNode(0)
+    for a in arr:
+        node = ListNode(a)
+        head.next = node
+        head = head.next
+    return dum.next
+
+
+def linked_list_to_list(head: ListNode | None) -> list[int]:
+    """將鏈結串列序列化為串列"""
+    arr: list[int] = []
+    while head:
+        arr.append(head.val)
+        head = head.next
+    return arr
@@ -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)
@@ -0,0 +1,69 @@
+"""
+File: tree_node.py
+Created Time: 2021-12-11
+Author: krahets (krahets@163.com)
+"""
+
+from collections import deque
+
+
+class TreeNode:
+    """二元樹節點類別"""
+
+    def __init__(self, val: int = 0):
+        self.val: int = val  # 節點值
+        self.height: int = 0  # 節點高度
+        self.left: TreeNode | None = None  # 左子節點引用
+        self.right: TreeNode | None = None  # 右子節點引用
+
+    # 序列化編碼規則請參考：
+    # https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
+    # 二元樹的陣列表示：
+    # [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]
+    # 二元樹的鏈結串列表示：
+    #             /——— 15
+    #         /——— 7
+    #     /——— 3
+    #    |    \——— 6
+    #    |        \——— 12
+    # ——— 1
+    #     \——— 2
+    #        |    /——— 9
+    #         \——— 4
+    #             \——— 8
+
+
+def list_to_tree_dfs(arr: list[int], i: int) -> TreeNode | None:
+    """將串列反序列化為二元樹：遞迴"""
+    # 如果索引超出陣列長度，或者對應的元素為 None ，則返回 None
+    if i < 0 or i >= len(arr) or arr[i] is None:
+        return None
+    # 構建當前節點
+    root = TreeNode(arr[i])
+    # 遞迴構建左右子樹
+    root.left = list_to_tree_dfs(arr, 2 * i + 1)
+    root.right = list_to_tree_dfs(arr, 2 * i + 2)
+    return root
+
+
+def list_to_tree(arr: list[int]) -> TreeNode | None:
+    """將串列反序列化為二元樹"""
+    return list_to_tree_dfs(arr, 0)
+
+
+def tree_to_list_dfs(root: TreeNode, i: int, res: list[int]) -> list[int]:
+    """將二元樹序列化為串列：遞迴"""
+    if root is None:
+        return
+    if i >= len(res):
+        res += [None] * (i - len(res) + 1)
+    res[i] = root.val
+    tree_to_list_dfs(root.left, 2 * i + 1, res)
+    tree_to_list_dfs(root.right, 2 * i + 2, res)
+
+
+def tree_to_list(root: TreeNode | None) -> list[int]:
+    """將二元樹序列化為串列"""
+    res = []
+    tree_to_list_dfs(root, 0, res)
+    return res
@@ -0,0 +1,20 @@
+# File: vertex.py
+# Created Time: 2023-02-23
+# Author: krahets (krahets@163.com)
+
+
+class Vertex:
+    """頂點類別"""
+
+    def __init__(self, val: int):
+        self.val = val
+
+
+def vals_to_vets(vals: list[int]) -> list["Vertex"]:
+    """輸入值串列 vals ，返回頂點串列 vets"""
+    return [Vertex(val) for val in vals]
+
+
+def vets_to_vals(vets: list["Vertex"]) -> list[int]:
+    """輸入頂點串列 vets ，返回值串列 vals"""
+    return [vet.val for vet in vets]