xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-10 14:36:06 +00: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
en/codes/cpp/chapter_divide_and_conquer/binary_search_recur.cpp
+10 -10
View File
@@ -8,20 +8,20 @@
/* Binary search: problem f(i, j) */
int dfs(vector<int> &nums, int target, int i, int j) {
// If the interval is empty, indicating no target element, return -1
// If the interval is empty, it means there is no target element, return -1
if (i > j) {
return -1;
}
// Calculate midpoint index m
int m = i + (j - i) / 2;
// Calculate the midpoint index m
int m = (i + j) / 2;
if (nums[m] < target) {
// Recursive subproblem f(m+1, j)
// Recursion subproblem f(m+1, j)
return dfs(nums, target, m + 1, j);
} else if (nums[m] > target) {
// Recursive subproblem f(i, m-1)
// Recursion subproblem f(i, m-1)
return dfs(nums, target, i, m - 1);
} else {
// Found the target element, thus return its index
// Found the target element, return its index
return m;
}
}
@@ -29,7 +29,7 @@ int dfs(vector<int> &nums, int target, int i, int j) {
/* Binary search */
int binarySearch(vector<int> &nums, int target) {
int n = nums.size();
// Solve problem f(0, n-1)
// Solve the problem f(0, n-1)
return dfs(nums, target, 0, n - 1);
}
@@ -38,9 +38,9 @@ int main() {
int target = 6;
vector<int> nums = {1, 3, 6, 8, 12, 15, 23, 26, 31, 35};
// Binary search (double closed interval)
// Binary search (closed interval on both sides)
int index = binarySearch(nums, target);
cout << "Index of target element 6 =" << index << endl;
cout << "Index of target element 6 = " << index << endl;
return 0;
}
}
en/codes/cpp/chapter_divide_and_conquer/build_tree.cpp
+10 -10
View File
@@ -6,26 +6,26 @@
#include "../utils/common.hpp"
/* Build binary tree: Divide and conquer */
/* Build binary tree: divide and conquer */
TreeNode *dfs(vector<int> &preorder, unordered_map<int, int> &inorderMap, int i, int l, int r) {
// Terminate when subtree interval is empty
// Terminate when the subtree interval is empty
if (r - l < 0)
return NULL;
// Initialize root node
// Initialize the root node
TreeNode *root = new TreeNode(preorder[i]);
// Query m to divide left and right subtrees
// Query m to divide the left and right subtrees
int m = inorderMap[preorder[i]];
// Subproblem: build left subtree
// Subproblem: build the left subtree
root->left = dfs(preorder, inorderMap, i + 1, l, m - 1);
// Subproblem: build right subtree
// Subproblem: build the right subtree
root->right = dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
// Return root node
// Return the root node
return root;
}
/* Build binary tree */
TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
// Initialize hash table, storing in-order elements to indices mapping
// Initialize hash map, storing the mapping from inorder elements to indices
unordered_map<int, int> inorderMap;
for (int i = 0; i < inorder.size(); i++) {
inorderMap[inorder[i]] = i;
@@ -38,9 +38,9 @@ TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
int main() {
vector<int> preorder = {3, 9, 2, 1, 7};
vector<int> inorder = {9, 3, 1, 2, 7};
cout << "Pre-order traversal = ";
cout << "Preorder traversal = ";
printVector(preorder);
cout << "In-order traversal = ";
cout << "Inorder traversal = ";
printVector(inorder);
TreeNode *root = buildTree(preorder, inorder);
en/codes/cpp/chapter_divide_and_conquer/hanota.cpp
+9 -9
View File
@@ -6,40 +6,40 @@
#include "../utils/common.hpp"
/* Move a disc */
/* Move a disk */
void move(vector<int> &src, vector<int> &tar) {
// Take out a disc from the top of src
// Take out a disk from the top of src
int pan = src.back();
src.pop_back();
// Place the disc on top of tar
// Place the disk on top of tar
tar.push_back(pan);
}
/* Solve the Tower of Hanoi problem f(i) */
void dfs(int i, vector<int> &src, vector<int> &buf, vector<int> &tar) {
// If only one disc remains on src, move it to tar
// If there is only one disk left in src, move it directly to tar
if (i == 1) {
move(src, tar);
return;
}
// Subproblem f(i-1): move the top i-1 discs from src with the help of tar to buf
// Subproblem f(i-1): move the top i-1 disks from src to buf using tar
dfs(i - 1, src, tar, buf);
// Subproblem f(1): move the remaining one disc from src to tar
// Subproblem f(1): move the remaining disk from src to tar
move(src, tar);
// Subproblem f(i-1): move the top i-1 discs from buf with the help of src to tar
// Subproblem f(i-1): move the top i-1 disks from buf to tar using src
dfs(i - 1, buf, src, tar);
}
/* Solve the Tower of Hanoi problem */
void solveHanota(vector<int> &A, vector<int> &B, vector<int> &C) {
int n = A.size();
// Move the top n discs from A with the help of B to C
// Move the top n disks from A to C using B
dfs(n, A, B, C);
}
/* Driver Code */
int main() {
// The tail of the list is the top of the pillar
// The tail of the list is the top of the rod
vector<int> A = {5, 4, 3, 2, 1};
vector<int> B = {};
vector<int> C = {};