mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-17 01:06:07 +00:00
Translate all code to English (#1836)
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
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;
|
||||
|
||||
/* Linked list node */
|
||||
public class ListNode(int x) {
|
||||
public int val = x;
|
||||
public ListNode? next;
|
||||
|
||||
/* Deserialize array to linked list */
|
||||
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 {
|
||||
/* Print list */
|
||||
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"))} ]";
|
||||
}
|
||||
|
||||
/* Print matrix (Array) */
|
||||
public static void PrintMatrix<T>(T[][] matrix) {
|
||||
Console.WriteLine("[");
|
||||
foreach (T[] row in matrix) {
|
||||
Console.WriteLine(" " + string.Join(", ", row) + ",");
|
||||
}
|
||||
Console.WriteLine("]");
|
||||
}
|
||||
|
||||
/* Print matrix (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("]");
|
||||
}
|
||||
|
||||
/* Print linked list */
|
||||
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));
|
||||
}
|
||||
|
||||
/**
|
||||
* Print binary tree
|
||||
* 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);
|
||||
}
|
||||
|
||||
/* Print binary tree */
|
||||
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);
|
||||
}
|
||||
|
||||
/* Print hash table */
|
||||
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());
|
||||
}
|
||||
}
|
||||
|
||||
/* Print heap */
|
||||
public static void PrintHeap(Queue<int> queue) {
|
||||
Console.Write("Heap array representation:");
|
||||
List<int> list = [.. queue];
|
||||
Console.WriteLine(string.Join(',', list));
|
||||
Console.WriteLine("Heap tree representation:");
|
||||
TreeNode? tree = TreeNode.ListToTree(list.Cast<int?>().ToList());
|
||||
PrintTree(tree);
|
||||
}
|
||||
|
||||
/* Print priority queue */
|
||||
public static void PrintHeap(PriorityQueue<int, int> queue) {
|
||||
var newQueue = new PriorityQueue<int, int>(queue.UnorderedItems, queue.Comparer);
|
||||
Console.Write("Heap array representation:");
|
||||
List<int> list = [];
|
||||
while (newQueue.TryDequeue(out int element, out _)) {
|
||||
list.Add(element);
|
||||
}
|
||||
Console.WriteLine("Heap tree representation:");
|
||||
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;
|
||||
|
||||
/* Binary tree node class */
|
||||
public class TreeNode(int? x) {
|
||||
public int? val = x; // Node value
|
||||
public int height; // Node height
|
||||
public TreeNode? left; // Reference to left child node
|
||||
public TreeNode? right; // Reference to right child node
|
||||
|
||||
// For the serialization encoding rules, please refer to:
|
||||
// https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
|
||||
// Array representation of binary tree:
|
||||
// [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]
|
||||
// Linked list representation of binary tree:
|
||||
// /——— 15
|
||||
// /——— 7
|
||||
// /——— 3
|
||||
// | \——— 6
|
||||
// | \——— 12
|
||||
// ——— 1
|
||||
// \——— 2
|
||||
// | /——— 9
|
||||
// \——— 4
|
||||
// \——— 8
|
||||
|
||||
/* Deserialize a list into a binary tree: recursion */
|
||||
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;
|
||||
}
|
||||
|
||||
/* Deserialize a list into a binary tree */
|
||||
public static TreeNode? ListToTree(List<int?> arr) {
|
||||
return ListToTreeDFS(arr, 0);
|
||||
}
|
||||
|
||||
/* Serialize a binary tree into a list: recursion */
|
||||
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);
|
||||
}
|
||||
|
||||
/* Serialize a binary tree into a list */
|
||||
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;
|
||||
|
||||
/* Vertex class */
|
||||
public class Vertex(int val) {
|
||||
public int val = val;
|
||||
|
||||
/* Input value list vals, return vertex list 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;
|
||||
}
|
||||
|
||||
/* Input vertex list vets, return value list 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