mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-19 15:00:58 +00: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
@@ -0,0 +1,32 @@
|
||||
// File: ListNode.cs
|
||||
// Created Time: 2022-12-16
|
||||
// Author: mingXta (1195669834@qq.com)
|
||||
|
||||
namespace hello_algo.utils;
|
||||
|
||||
/* 鏈結串列節點 */
|
||||
public class ListNode(int x) {
|
||||
public int val = x;
|
||||
public ListNode? next;
|
||||
|
||||
/* 將陣列反序列化為鏈結串列 */
|
||||
public static ListNode? ArrToLinkedList(int[] arr) {
|
||||
ListNode dum = new(0);
|
||||
ListNode head = dum;
|
||||
foreach (int val in arr) {
|
||||
head.next = new ListNode(val);
|
||||
head = head.next;
|
||||
}
|
||||
return dum.next;
|
||||
}
|
||||
|
||||
public override string? ToString() {
|
||||
List<string> list = [];
|
||||
var head = this;
|
||||
while (head != null) {
|
||||
list.Add(head.val.ToString());
|
||||
head = head.next;
|
||||
}
|
||||
return string.Join("->", list);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,132 @@
|
||||
/**
|
||||
* File: PrintUtil.cs
|
||||
* Created Time: 2022-12-23
|
||||
* Author: haptear (haptear@hotmail.com), krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
namespace hello_algo.utils;
|
||||
|
||||
public class Trunk(Trunk? prev, string str) {
|
||||
public Trunk? prev = prev;
|
||||
public string str = str;
|
||||
};
|
||||
|
||||
public static class PrintUtil {
|
||||
/* 列印串列 */
|
||||
public static void PrintList<T>(IList<T> list) {
|
||||
Console.WriteLine("[" + string.Join(", ", list) + "]");
|
||||
}
|
||||
|
||||
public static string PrintList<T>(this IEnumerable<T?> list) {
|
||||
return $"[ {string.Join(", ", list.Select(x => x?.ToString() ?? "null"))} ]";
|
||||
}
|
||||
|
||||
/* 列印矩陣 (Array) */
|
||||
public static void PrintMatrix<T>(T[][] matrix) {
|
||||
Console.WriteLine("[");
|
||||
foreach (T[] row in matrix) {
|
||||
Console.WriteLine(" " + string.Join(", ", row) + ",");
|
||||
}
|
||||
Console.WriteLine("]");
|
||||
}
|
||||
|
||||
/* 列印矩陣 (List) */
|
||||
public static void PrintMatrix<T>(List<List<T>> matrix) {
|
||||
Console.WriteLine("[");
|
||||
foreach (List<T> row in matrix) {
|
||||
Console.WriteLine(" " + string.Join(", ", row) + ",");
|
||||
}
|
||||
Console.WriteLine("]");
|
||||
}
|
||||
|
||||
/* 列印鏈結串列 */
|
||||
public static void PrintLinkedList(ListNode? head) {
|
||||
List<string> list = [];
|
||||
while (head != null) {
|
||||
list.Add(head.val.ToString());
|
||||
head = head.next;
|
||||
}
|
||||
Console.Write(string.Join(" -> ", list));
|
||||
}
|
||||
|
||||
/**
|
||||
* 列印二元樹
|
||||
* This tree printer is borrowed from TECHIE DELIGHT
|
||||
* https://www.techiedelight.com/c-program-print-binary-tree/
|
||||
*/
|
||||
public static void PrintTree(TreeNode? root) {
|
||||
PrintTree(root, null, false);
|
||||
}
|
||||
|
||||
/* 列印二元樹 */
|
||||
public static void PrintTree(TreeNode? root, Trunk? prev, bool isRight) {
|
||||
if (root == null) {
|
||||
return;
|
||||
}
|
||||
|
||||
string prev_str = " ";
|
||||
Trunk trunk = new(prev, prev_str);
|
||||
|
||||
PrintTree(root.right, trunk, true);
|
||||
|
||||
if (prev == null) {
|
||||
trunk.str = "———";
|
||||
} else if (isRight) {
|
||||
trunk.str = "/———";
|
||||
prev_str = " |";
|
||||
} else {
|
||||
trunk.str = "\\———";
|
||||
prev.str = prev_str;
|
||||
}
|
||||
|
||||
ShowTrunks(trunk);
|
||||
Console.WriteLine(" " + root.val);
|
||||
|
||||
if (prev != null) {
|
||||
prev.str = prev_str;
|
||||
}
|
||||
trunk.str = " |";
|
||||
|
||||
PrintTree(root.left, trunk, false);
|
||||
}
|
||||
|
||||
public static void ShowTrunks(Trunk? p) {
|
||||
if (p == null) {
|
||||
return;
|
||||
}
|
||||
|
||||
ShowTrunks(p.prev);
|
||||
Console.Write(p.str);
|
||||
}
|
||||
|
||||
/* 列印雜湊表 */
|
||||
public static void PrintHashMap<K, V>(Dictionary<K, V> map) where K : notnull {
|
||||
foreach (var kv in map.Keys) {
|
||||
Console.WriteLine(kv.ToString() + " -> " + map[kv]?.ToString());
|
||||
}
|
||||
}
|
||||
|
||||
/* 列印堆積 */
|
||||
public static void PrintHeap(Queue<int> queue) {
|
||||
Console.Write("堆積的陣列表示：");
|
||||
List<int> list = [.. queue];
|
||||
Console.WriteLine(string.Join(',', list));
|
||||
Console.WriteLine("堆積的樹狀表示：");
|
||||
TreeNode? tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
|
||||
PrintTree(tree);
|
||||
}
|
||||
|
||||
/* 列印優先佇列 */
|
||||
public static void PrintHeap(PriorityQueue<int, int> queue) {
|
||||
var newQueue = new PriorityQueue<int, int>(queue.UnorderedItems, queue.Comparer);
|
||||
Console.Write("堆積的陣列表示：");
|
||||
List<int> list = [];
|
||||
while (newQueue.TryDequeue(out int element, out _)) {
|
||||
list.Add(element);
|
||||
}
|
||||
Console.WriteLine("堆積的樹狀表示：");
|
||||
Console.WriteLine(string.Join(',', list.ToList()));
|
||||
TreeNode? tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
|
||||
PrintTree(tree);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,67 @@
|
||||
/**
|
||||
* File: TreeNode.cs
|
||||
* Created Time: 2022-12-23
|
||||
* Author: haptear (haptear@hotmail.com)
|
||||
*/
|
||||
|
||||
namespace hello_algo.utils;
|
||||
|
||||
/* 二元樹節點類別 */
|
||||
public class TreeNode(int? x) {
|
||||
public int? val = x; // 節點值
|
||||
public int height; // 節點高度
|
||||
public TreeNode? left; // 左子節點引用
|
||||
public TreeNode? right; // 右子節點引用
|
||||
|
||||
// 序列化編碼規則請參考：
|
||||
// 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
|
||||
|
||||
/* 將串列反序列化為二元樹：遞迴 */
|
||||
static TreeNode? ListToTreeDFS(List<int?> arr, int i) {
|
||||
if (i < 0 || i >= arr.Count || !arr[i].HasValue) {
|
||||
return null;
|
||||
}
|
||||
TreeNode root = new(arr[i]) {
|
||||
left = ListToTreeDFS(arr, 2 * i + 1),
|
||||
right = ListToTreeDFS(arr, 2 * i + 2)
|
||||
};
|
||||
return root;
|
||||
}
|
||||
|
||||
/* 將串列反序列化為二元樹 */
|
||||
public static TreeNode? ListToTree(List<int?> arr) {
|
||||
return ListToTreeDFS(arr, 0);
|
||||
}
|
||||
|
||||
/* 將二元樹序列化為串列：遞迴 */
|
||||
static void TreeToListDFS(TreeNode? root, int i, List<int?> res) {
|
||||
if (root == null)
|
||||
return;
|
||||
while (i >= res.Count) {
|
||||
res.Add(null);
|
||||
}
|
||||
res[i] = root.val;
|
||||
TreeToListDFS(root.left, 2 * i + 1, res);
|
||||
TreeToListDFS(root.right, 2 * i + 2, res);
|
||||
}
|
||||
|
||||
/* 將二元樹序列化為串列 */
|
||||
public static List<int?> TreeToList(TreeNode root) {
|
||||
List<int?> res = [];
|
||||
TreeToListDFS(root, 0, res);
|
||||
return res;
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,30 @@
|
||||
/**
|
||||
* File: Vertex.cs
|
||||
* Created Time: 2023-02-06
|
||||
* Author: zjkung1123 (zjkung1123@gmail.com), krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
namespace hello_algo.utils;
|
||||
|
||||
/* 頂點類別 */
|
||||
public class Vertex(int val) {
|
||||
public int val = val;
|
||||
|
||||
/* 輸入值串列 vals ，返回頂點串列 vets */
|
||||
public static Vertex[] ValsToVets(int[] vals) {
|
||||
Vertex[] vets = new Vertex[vals.Length];
|
||||
for (int i = 0; i < vals.Length; i++) {
|
||||
vets[i] = new Vertex(vals[i]);
|
||||
}
|
||||
return vets;
|
||||
}
|
||||
|
||||
/* 輸入頂點串列 vets ，返回值串列 vals */
|
||||
public static List<int> VetsToVals(List<Vertex> vets) {
|
||||
List<int> vals = [];
|
||||
foreach (Vertex vet in vets) {
|
||||
vals.Add(vet.val);
|
||||
}
|
||||
return vals;
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user