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
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions

View File

@@ -6,11 +6,11 @@ Author: krahets (krahets@163.com)
class ListNode:
"""LinkedList node class"""
"""Linked list node class"""
def __init__(self, val: int):
self.val: int = val # Node value
self.next: ListNode | None = None # Reference to successor node
self.next: ListNode | None = None # Reference to next node
def list_to_linked_list(arr: list[int]) -> ListNode | None:

View File

@@ -13,14 +13,14 @@ class TreeNode:
def __init__(self, val: int = 0):
self.val: int = val # Node value
self.height: int = 0 # Node height
self.left: TreeNode | None = None # Reference to the left child node
self.right: TreeNode | None = None # Reference to the right child node
self.left: TreeNode | None = None # Reference to left child node
self.right: TreeNode | None = None # Reference to right child node
# 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
@@ -34,13 +34,13 @@ class TreeNode:
def list_to_tree_dfs(arr: list[int], i: int) -> TreeNode | None:
"""Deserialize a list into a binary tree: Recursively"""
# If the index is out of array bounds, or the corresponding element is None, return None
"""Deserialize a list into a binary tree: recursion"""
# If the index exceeds the array length, or the corresponding element is None, return None
if i < 0 or i >= len(arr) or arr[i] is None:
return None
# Construct the current node
# Build the current node
root = TreeNode(arr[i])
# Recursively construct left and right subtrees
# Recursively build the left and right subtrees
root.left = list_to_tree_dfs(arr, 2 * i + 1)
root.right = list_to_tree_dfs(arr, 2 * i + 2)
return root
@@ -52,7 +52,7 @@ def list_to_tree(arr: list[int]) -> TreeNode | None:
def tree_to_list_dfs(root: TreeNode, i: int, res: list[int]) -> list[int]:
"""Serialize a binary tree into a list: Recursively"""
"""Serialize a binary tree into a list: recursion"""
if root is None:
return
if i >= len(res):

View File

@@ -11,10 +11,10 @@ class Vertex:
def vals_to_vets(vals: list[int]) -> list["Vertex"]:
"""Input a list of values vals, return a list of vertices vets"""
"""Input value list vals, return vertex list vets"""
return [Vertex(val) for val in vals]
def vets_to_vals(vets: list["Vertex"]) -> list[int]:
"""Input a list of vertices vets, return a list of values vals"""
"""Input vertex list vets, return value list vals"""
return [vet.val for vet in vets]