algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Traditional Chinese version (#1163)

Browse Source 
* 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
2024-04-06 02:30:11 +08:00
committed by GitHub
parent 33d7f8a2e5
commit 5f7385c8a3
1875 changed files with 102923 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

117
zh-hant/codes/python/chapter_hashing/array_hash_map.py Normal file
View File

@ -0,0 +1,117 @@
"""
File: array_hash_map.py
Created Time: 2022-12-14
Author: msk397 (machangxinq@gmail.com)
"""
class Pair:
"""鍵值對"""
def __init__(self, key: int, val: str):
self.key = key
self.val = val
class ArrayHashMap:
"""基於陣列實現的雜湊表"""
def __init__(self):
"""建構子"""
# 初始化陣列，包含 100 個桶
self.buckets: list[Pair | None] = [None] * 100
def hash_func(self, key: int) -> int:
"""雜湊函式"""
index = key % 100
return index
def get(self, key: int) -> str:
"""查詢操作"""
index: int = self.hash_func(key)
pair: Pair = self.buckets[index]
if pair is None:
return None
return pair.val
def put(self, key: int, val: str):
"""新增操作"""
pair = Pair(key, val)
index: int = self.hash_func(key)
self.buckets[index] = pair
def remove(self, key: int):
"""刪除操作"""
index: int = self.hash_func(key)
# 置為 None ，代表刪除
self.buckets[index] = None
def entry_set(self) -> list[Pair]:
"""獲取所有鍵值對"""
result: list[Pair] = []
for pair in self.buckets:
if pair is not None:
result.append(pair)
return result
def key_set(self) -> list[int]:
"""獲取所有鍵"""
result = []
for pair in self.buckets:
if pair is not None:
result.append(pair.key)
return result
def value_set(self) -> list[str]:
"""獲取所有值"""
result = []
for pair in self.buckets:
if pair is not None:
result.append(pair.val)
return result
def print(self):
"""列印雜湊表"""
for pair in self.buckets:
if pair is not None:
print(pair.key, "->", pair.val)
"""Driver Code"""
if __name__ == "__main__":
# 初始化雜湊表
hmap = ArrayHashMap()
# 新增操作
# 在雜湊表中新增鍵值對 (key, value)
hmap.put(12836, "小哈")
hmap.put(15937, "小囉")
hmap.put(16750, "小算")
hmap.put(13276, "小法")
hmap.put(10583, "小鴨")
print("\n新增完成後，雜湊表為\nKey -> Value")
hmap.print()
# 查詢操作
# 向雜湊表中輸入鍵 key ，得到值 value
name = hmap.get(15937)
print("\n輸入學號 15937 ，查詢到姓名 " + name)
# 刪除操作
# 在雜湊表中刪除鍵值對 (key, value)
hmap.remove(10583)
print("\n刪除 10583 後，雜湊表為\nKey -> Value")
hmap.print()
# 走訪雜湊表
print("\n走訪鍵值對 Key->Value")
for pair in hmap.entry_set():
print(pair.key, "->", pair.val)
print("\n單獨走訪鍵 Key")
for key in hmap.key_set():
print(key)
print("\n單獨走訪值 Value")
for val in hmap.value_set():
print(val)

37
zh-hant/codes/python/chapter_hashing/built_in_hash.py Normal file
View File

@ -0,0 +1,37 @@
"""
File: built_in_hash.py
Created Time: 2023-06-15
Author: krahets (krahets@163.com)
"""
import sys
from pathlib import Path
sys.path.append(str(Path(__file__).parent.parent))
from modules import ListNode
"""Driver Code"""
if __name__ == "__main__":
num = 3
hash_num = hash(num)
print(f"整數 {num} 的雜湊值為 {hash_num}")
bol = True
hash_bol = hash(bol)
print(f"布林量 {bol} 的雜湊值為 {hash_bol}")
dec = 3.14159
hash_dec = hash(dec)
print(f"小數 {dec} 的雜湊值為 {hash_dec}")
str = "Hello 演算法"
hash_str = hash(str)
print(f"字串 {str} 的雜湊值為 {hash_str}")
tup = (12836, "小哈")
hash_tup = hash(tup)
print(f"元組 {tup} 的雜湊值為 {hash(hash_tup)}")
obj = ListNode(0)
hash_obj = hash(obj)
print(f"節點物件 {obj} 的雜湊值為 {hash_obj}")

50
zh-hant/codes/python/chapter_hashing/hash_map.py Normal file
View File

@ -0,0 +1,50 @@
"""
File: hash_map.py
Created Time: 2022-12-14
Author: msk397 (machangxinq@gmail.com)
"""
import sys
from pathlib import Path
sys.path.append(str(Path(__file__).parent.parent))
from modules import print_dict
"""Driver Code"""
if __name__ == "__main__":
# 初始化雜湊表
hmap = dict[int, str]()
# 新增操作
# 在雜湊表中新增鍵值對 (key, value)
hmap[12836] = "小哈"
hmap[15937] = "小囉"
hmap[16750] = "小算"
hmap[13276] = "小法"
hmap[10583] = "小鴨"
print("\n新增完成後，雜湊表為\nKey -> Value")
print_dict(hmap)
# 查詢操作
# 向雜湊表中輸入鍵 key ，得到值 value
name: str = hmap[15937]
print("\n輸入學號 15937 ，查詢到姓名 " + name)
# 刪除操作
# 在雜湊表中刪除鍵值對 (key, value)
hmap.pop(10583)
print("\n刪除 10583 後，雜湊表為\nKey -> Value")
print_dict(hmap)
# 走訪雜湊表
print("\n走訪鍵值對 Key->Value")
for key, value in hmap.items():
print(key, "->", value)
print("\n單獨走訪鍵 Key")
for key in hmap.keys():
print(key)
print("\n單獨走訪值 Value")
for val in hmap.values():
print(val)

118
zh-hant/codes/python/chapter_hashing/hash_map_chaining.py Normal file
View File

@ -0,0 +1,118 @@
"""
File: hash_map_chaining.py
Created Time: 2023-06-13
Author: krahets (krahets@163.com)
"""
import sys
from pathlib import Path
sys.path.append(str(Path(__file__).parent.parent))
from chapter_hashing.array_hash_map import Pair
class HashMapChaining:
"""鏈式位址雜湊表"""
def __init__(self):
"""建構子"""
self.size = 0 # 鍵值對數量
self.capacity = 4 # 雜湊表容量
self.load_thres = 2.0 / 3.0 # 觸發擴容的負載因子閾值
self.extend_ratio = 2 # 擴容倍數
self.buckets = [[] for _ in range(self.capacity)] # 桶陣列
def hash_func(self, key: int) -> int:
"""雜湊函式"""
return key % self.capacity
def load_factor(self) -> float:
"""負載因子"""
return self.size / self.capacity
def get(self, key: int) -> str | None:
"""查詢操作"""
index = self.hash_func(key)
bucket = self.buckets[index]
# 走訪桶，若找到 key ，則返回對應 val
for pair in bucket:
if pair.key == key:
return pair.val
# 若未找到 key ，則返回 None
return None
def put(self, key: int, val: str):
"""新增操作"""
# 當負載因子超過閾值時，執行擴容
if self.load_factor() > self.load_thres:
self.extend()
index = self.hash_func(key)
bucket = self.buckets[index]
# 走訪桶，若遇到指定 key ，則更新對應 val 並返回
for pair in bucket:
if pair.key == key:
pair.val = val
return
# 若無該 key ，則將鍵值對新增至尾部
pair = Pair(key, val)
bucket.append(pair)
self.size += 1
def remove(self, key: int):
"""刪除操作"""
index = self.hash_func(key)
bucket = self.buckets[index]
# 走訪桶，從中刪除鍵值對
for pair in bucket:
if pair.key == key:
bucket.remove(pair)
self.size -= 1
break
def extend(self):
"""擴容雜湊表"""
# 暫存原雜湊表
buckets = self.buckets
# 初始化擴容後的新雜湊表
self.capacity *= self.extend_ratio
self.buckets = [[] for _ in range(self.capacity)]
self.size = 0
# 將鍵值對從原雜湊表搬運至新雜湊表
for bucket in buckets:
for pair in bucket:
self.put(pair.key, pair.val)
def print(self):
"""列印雜湊表"""
for bucket in self.buckets:
res = []
for pair in bucket:
res.append(str(pair.key) + " -> " + pair.val)
print(res)
"""Driver Code"""
if __name__ == "__main__":
# 初始化雜湊表
hashmap = HashMapChaining()
# 新增操作
# 在雜湊表中新增鍵值對 (key, value)
hashmap.put(12836, "小哈")
hashmap.put(15937, "小囉")
hashmap.put(16750, "小算")
hashmap.put(13276, "小法")
hashmap.put(10583, "小鴨")
print("\n新增完成後，雜湊表為\n[Key1 -> Value1, Key2 -> Value2, ...]")
hashmap.print()
# 查詢操作
# 向雜湊表中輸入鍵 key ，得到值 value
name = hashmap.get(13276)
print("\n輸入學號 13276 ，查詢到姓名 " + name)
# 刪除操作
# 在雜湊表中刪除鍵值對 (key, value)
hashmap.remove(12836)
print("\n刪除 12836 後，雜湊表為\n[Key1 -> Value1, Key2 -> Value2, ...]")
hashmap.print()

138
zh-hant/codes/python/chapter_hashing/hash_map_open_addressing.py Normal file
View File

@ -0,0 +1,138 @@
"""
File: hash_map_open_addressing.py
Created Time: 2023-06-13
Author: krahets (krahets@163.com)
"""
import sys
from pathlib import Path
sys.path.append(str(Path(__file__).parent.parent))
from chapter_hashing.array_hash_map import Pair
class HashMapOpenAddressing:
"""開放定址雜湊表"""
def __init__(self):
"""建構子"""
self.size = 0 # 鍵值對數量
self.capacity = 4 # 雜湊表容量
self.load_thres = 2.0 / 3.0 # 觸發擴容的負載因子閾值
self.extend_ratio = 2 # 擴容倍數
self.buckets: list[Pair | None] = [None] * self.capacity # 桶陣列
self.TOMBSTONE = Pair(-1, "-1") # 刪除標記
def hash_func(self, key: int) -> int:
"""雜湊函式"""
return key % self.capacity
def load_factor(self) -> float:
"""負載因子"""
return self.size / self.capacity
def find_bucket(self, key: int) -> int:
"""搜尋 key 對應的桶索引"""
index = self.hash_func(key)
first_tombstone = -1
# 線性探查，當遇到空桶時跳出
while self.buckets[index] is not None:
# 若遇到 key ，返回對應的桶索引
if self.buckets[index].key == key:
# 若之前遇到了刪除標記，則將鍵值對移動至該索引處
if first_tombstone != -1:
self.buckets[first_tombstone] = self.buckets[index]
self.buckets[index] = self.TOMBSTONE
return first_tombstone # 返回移動後的桶索引
return index # 返回桶索引
# 記錄遇到的首個刪除標記
if first_tombstone == -1 and self.buckets[index] is self.TOMBSTONE:
first_tombstone = index
# 計算桶索引，越過尾部則返回頭部
index = (index + 1) % self.capacity
# 若 key 不存在，則返回新增點的索引
return index if first_tombstone == -1 else first_tombstone
def get(self, key: int) -> str:
"""查詢操作"""
# 搜尋 key 對應的桶索引
index = self.find_bucket(key)
# 若找到鍵值對，則返回對應 val
if self.buckets[index] not in [None, self.TOMBSTONE]:
return self.buckets[index].val
# 若鍵值對不存在，則返回 None
return None
def put(self, key: int, val: str):
"""新增操作"""
# 當負載因子超過閾值時，執行擴容
if self.load_factor() > self.load_thres:
self.extend()
# 搜尋 key 對應的桶索引
index = self.find_bucket(key)
# 若找到鍵值對，則覆蓋 val 並返回
if self.buckets[index] not in [None, self.TOMBSTONE]:
self.buckets[index].val = val
return
# 若鍵值對不存在，則新增該鍵值對
self.buckets[index] = Pair(key, val)
self.size += 1
def remove(self, key: int):
"""刪除操作"""
# 搜尋 key 對應的桶索引
index = self.find_bucket(key)
# 若找到鍵值對，則用刪除標記覆蓋它
if self.buckets[index] not in [None, self.TOMBSTONE]:
self.buckets[index] = self.TOMBSTONE
self.size -= 1
def extend(self):
"""擴容雜湊表"""
# 暫存原雜湊表
buckets_tmp = self.buckets
# 初始化擴容後的新雜湊表
self.capacity *= self.extend_ratio
self.buckets = [None] * self.capacity
self.size = 0
# 將鍵值對從原雜湊表搬運至新雜湊表
for pair in buckets_tmp:
if pair not in [None, self.TOMBSTONE]:
self.put(pair.key, pair.val)
def print(self):
"""列印雜湊表"""
for pair in self.buckets:
if pair is None:
print("None")
elif pair is self.TOMBSTONE:
print("TOMBSTONE")
else:
print(pair.key, "->", pair.val)
"""Driver Code"""
if __name__ == "__main__":
# 初始化雜湊表
hashmap = HashMapOpenAddressing()
# 新增操作
# 在雜湊表中新增鍵值對 (key, val)
hashmap.put(12836, "小哈")
hashmap.put(15937, "小囉")
hashmap.put(16750, "小算")
hashmap.put(13276, "小法")
hashmap.put(10583, "小鴨")
print("\n新增完成後，雜湊表為\nKey -> Value")
hashmap.print()
# 查詢操作
# 向雜湊表中輸入鍵 key ，得到值 val
name = hashmap.get(13276)
print("\n輸入學號 13276 ，查詢到姓名 " + name)
# 刪除操作
# 在雜湊表中刪除鍵值對 (key, val)
hashmap.remove(16750)
print("\n刪除 16750 後，雜湊表為\nKey -> Value")
hashmap.print()

58
zh-hant/codes/python/chapter_hashing/simple_hash.py Normal file
View File

@ -0,0 +1,58 @@
"""
File: simple_hash.py
Created Time: 2023-06-15
Author: krahets (krahets@163.com)
"""
def add_hash(key: str) -> int:
"""加法雜湊"""
hash = 0
modulus = 1000000007
for c in key:
hash += ord(c)
return hash % modulus
def mul_hash(key: str) -> int:
"""乘法雜湊"""
hash = 0
modulus = 1000000007
for c in key:
hash = 31 * hash + ord(c)
return hash % modulus
def xor_hash(key: str) -> int:
"""互斥或雜湊"""
hash = 0
modulus = 1000000007
for c in key:
hash ^= ord(c)
return hash % modulus
def rot_hash(key: str) -> int:
"""旋轉雜湊"""
hash = 0
modulus = 1000000007
for c in key:
hash = (hash << 4) ^ (hash >> 28) ^ ord(c)
return hash % modulus
"""Driver Code"""
if __name__ == "__main__":
key = "Hello 演算法"
hash = add_hash(key)
print(f"加法雜湊值為 {hash}")
hash = mul_hash(key)
print(f"乘法雜湊值為 {hash}")
hash = xor_hash(key)
print(f"互斥或雜湊值為 {hash}")
hash = rot_hash(key)
print(f"旋轉雜湊值為 {hash}")