CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 16:49:44 +08:00
Code Issues Packages Projects Releases Wiki Activity

Translate all code to English (#1836)

Browse Source 
* 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
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
en/codes/java/utils/PrintUtil.java
View File

@@ -53,7 +53,7 @@ public class PrintUtil {
}
/**
* Print binary tree
* 打印二叉树
* This tree printer is borrowed from TECHIE DELIGHT
* https://www.techiedelight.com/c-program-print-binary-tree/
*/
@@ -104,12 +104,12 @@ public class PrintUtil {
}
}
/* Print heap (Priority queue) */
/* Print heap (priority queue) */
public static void printHeap(Queue<Integer> queue) {
List<Integer> list = new ArrayList<>(queue);
System.out.print("Array representation of the heap:");
System.out.print("Heap array representation:");
System.out.println(list);
System.out.println("Tree representation of the heap:");
System.out.println("Heap tree representation:");
TreeNode root = TreeNode.listToTree(list);
printTree(root);
}

14
en/codes/java/utils/TreeNode.java
View File

@@ -12,19 +12,19 @@ import java.util.*;
public class TreeNode {
public int val; // Node value
public int height; // Node height
public TreeNode left; // Reference to the left child node
public TreeNode right; // Reference to the right child node
public TreeNode left; // Reference to left child node
public TreeNode right; // Reference to right child node
/* Constructor */
public TreeNode(int x) {
val = x;
}
// For serialization encoding rules, refer to:
// For the serialization encoding rules, please refer to:
// https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
// Array representation of the binary 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 the binary tree:
// Linked list representation of binary tree:
// /——— 15
// /——— 7
// /——— 3
@@ -36,7 +36,7 @@ public class TreeNode {
// \——— 4
// \——— 8
/* Deserialize a list into a binary tree: Recursively */
/* Deserialize a list into a binary tree: recursion */
private static TreeNode listToTreeDFS(List<Integer> arr, int i) {
if (i < 0 || i >= arr.size() || arr.get(i) == null) {
return null;
@@ -52,7 +52,7 @@ public class TreeNode {
return listToTreeDFS(arr, 0);
}
/* Serialize a binary tree into a list: Recursively */
/* Serialize a binary tree into a list: recursion */
private static void treeToListDFS(TreeNode root, int i, List<Integer> res) {
if (root == null)
return;

4
en/codes/java/utils/Vertex.java
View File

@@ -16,7 +16,7 @@ public class Vertex {
this.val = val;
}
/* Input a list of values vals, return a list of vertices vets */
/* 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++) {
@@ -25,7 +25,7 @@ public class Vertex {
return vets;
}
/* Input a list of vertices vets, return a list of values vals */
/* Input vertex list vets, return value list vals */
public static List<Integer> vetsToVals(List<Vertex> vets) {
List<Integer> vals = new ArrayList<>();
for (Vertex vet : vets) {