CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-24 10:33:34 +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

40
en/codes/cpp/chapter_searching/binary_search.cpp
View File

@@ -6,39 +6,39 @@
#include "../utils/common.hpp"
/* Binary search (double closed interval) */
/* Binary search (closed interval on both sides) */
int binarySearch(vector<int> &nums, int target) {
// Initialize double closed interval [0, n-1], i.e., i, j point to the first element and last element of the array respectively
// Initialize closed interval [0, n-1], i.e., i, j point to the first and last elements of the array
int i = 0, j = nums.size() - 1;
// Loop until the search interval is empty (when i > j, it is empty)
// Loop, exit when the search interval is empty (empty when i > j)
while (i <= j) {
int m = i + (j - i) / 2; // Calculate midpoint index m
if (nums[m] < target) // This situation indicates that target is in the interval [m+1, j]
int m = i + (j - i) / 2; // Calculate the midpoint index m
if (nums[m] < target) // This means target is in the interval [m+1, j]
i = m + 1;
else if (nums[m] > target) // This situation indicates that target is in the interval [i, m-1]
else if (nums[m] > target) // This means target is in the interval [i, m-1]
j = m - 1;
else // Found the target element, thus return its index
else // Found the target element, return its index
return m;
}
// Did not find the target element, thus return -1
// Target element not found, return -1
return -1;
}
/* Binary search (left closed right open interval) */
/* Binary search (left-closed right-open interval) */
int binarySearchLCRO(vector<int> &nums, int target) {
// Initialize left closed right open interval [0, n), i.e., i, j point to the first element and the last element +1 of the array respectively
// Initialize left-closed right-open interval [0, n), i.e., i, j point to the first element and last element+1
int i = 0, j = nums.size();
// Loop until the search interval is empty (when i = j, it is empty)
// Loop, exit when the search interval is empty (empty when i = j)
while (i < j) {
int m = i + (j - i) / 2; // Calculate midpoint index m
if (nums[m] < target) // This situation indicates that target is in the interval [m+1, j)
int m = i + (j - i) / 2; // Calculate the midpoint index m
if (nums[m] < target) // This means target is in the interval [m+1, j)
i = m + 1;
else if (nums[m] > target) // This situation indicates that target is in the interval [i, m)
else if (nums[m] > target) // This means target is in the interval [i, m)
j = m;
else // Found the target element, thus return its index
else // Found the target element, return its index
return m;
}
// Did not find the target element, thus return -1
// Target element not found, return -1
return -1;
}
@@ -47,13 +47,13 @@ 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;
/* Binary search (left closed right open interval) */
/* Binary search (left-closed right-open interval) */
index = binarySearchLCRO(nums, target);
cout << "Index of target element 6 =" << index << endl;
cout << "Index of target element 6 = " << index << endl;
return 0;
}

18
en/codes/cpp/chapter_searching/binary_search_edge.cpp
View File

@@ -8,13 +8,13 @@
/* Binary search for insertion point (with duplicate elements) */
int binarySearchInsertion(const vector<int> &nums, int target) {
int i = 0, j = nums.size() - 1; // Initialize double closed interval [0, n-1]
int i = 0, j = nums.size() - 1; // Initialize closed interval [0, n-1]
while (i <= j) {
int m = i + (j - i) / 2; // Calculate midpoint index m
int m = i + (j - i) / 2; // Calculate the midpoint index m
if (nums[m] < target) {
i = m + 1; // Target is in interval [m+1, j]
i = m + 1; // target is in the interval [m+1, j]
} else {
j = m - 1; // First element less than target is in interval [i, m-1]
j = m - 1; // The first element less than target is in the interval [i, m-1]
}
}
// Return insertion point i
@@ -25,7 +25,7 @@ int binarySearchInsertion(const vector<int> &nums, int target) {
int binarySearchLeftEdge(vector<int> &nums, int target) {
// Equivalent to finding the insertion point of target
int i = binarySearchInsertion(nums, target);
// Did not find target, thus return -1
// Target not found, return -1
if (i == nums.size() || nums[i] != target) {
return -1;
}
@@ -39,7 +39,7 @@ int binarySearchRightEdge(vector<int> &nums, int target) {
int i = binarySearchInsertion(nums, target + 1);
// j points to the rightmost target, i points to the first element greater than target
int j = i - 1;
// Did not find target, thus return -1
// Target not found, return -1
if (j == -1 || nums[j] != target) {
return -1;
}
@@ -54,12 +54,12 @@ int main() {
cout << "\nArray nums = ";
printVector(nums);
// Binary search for left and right boundaries
// Binary search left and right boundaries
for (int target : {6, 7}) {
int index = binarySearchLeftEdge(nums, target);
cout << "The leftmost index of element " << target << " is " << index << endl;
cout << "Index of leftmost element " << target << " is " << index << endl;
index = binarySearchRightEdge(nums, target);
cout << "The rightmost index of element " << target << " is " << index << endl;
cout << "Index of rightmost element " << target << " is " << index << endl;
}
return 0;

24
en/codes/cpp/chapter_searching/binary_search_insertion.cpp
View File

@@ -8,32 +8,32 @@
/* Binary search for insertion point (no duplicate elements) */
int binarySearchInsertionSimple(vector<int> &nums, int target) {
int i = 0, j = nums.size() - 1; // Initialize double closed interval [0, n-1]
int i = 0, j = nums.size() - 1; // Initialize closed interval [0, n-1]
while (i <= j) {
int m = i + (j - i) / 2; // Calculate midpoint index m
int m = i + (j - i) / 2; // Calculate the midpoint index m
if (nums[m] < target) {
i = m + 1; // Target is in interval [m+1, j]
i = m + 1; // target is in the interval [m+1, j]
} else if (nums[m] > target) {
j = m - 1; // Target is in interval [i, m-1]
j = m - 1; // target is in the interval [i, m-1]
} else {
return m; // Found target, return insertion point m
}
}
// Did not find target, return insertion point i
// Target not found, return insertion point i
return i;
}
/* Binary search for insertion point (with duplicate elements) */
int binarySearchInsertion(vector<int> &nums, int target) {
int i = 0, j = nums.size() - 1; // Initialize double closed interval [0, n-1]
int i = 0, j = nums.size() - 1; // Initialize closed interval [0, n-1]
while (i <= j) {
int m = i + (j - i) / 2; // Calculate midpoint index m
int m = i + (j - i) / 2; // Calculate the midpoint index m
if (nums[m] < target) {
i = m + 1; // Target is in interval [m+1, j]
i = m + 1; // target is in the interval [m+1, j]
} else if (nums[m] > target) {
j = m - 1; // Target is in interval [i, m-1]
j = m - 1; // target is in the interval [i, m-1]
} else {
j = m - 1; // First element less than target is in interval [i, m-1]
j = m - 1; // The first element less than target is in the interval [i, m-1]
}
}
// Return insertion point i
@@ -49,7 +49,7 @@ int main() {
// Binary search for insertion point
for (int target : {6, 9}) {
int index = binarySearchInsertionSimple(nums, target);
cout << "The insertion point index for element " << target << " is " << index << endl;
cout << "Insertion point index for element " << target << " is " << index << endl;
}
// Array with duplicate elements
@@ -59,7 +59,7 @@ int main() {
// Binary search for insertion point
for (int target : {2, 6, 20}) {
int index = binarySearchInsertion(nums, target);
cout << "The insertion point index for element " << target << " is " << index << endl;
cout << "Insertion point index for element " << target << " is " << index << endl;
}
return 0;

8
en/codes/cpp/chapter_searching/hashing_search.cpp
View File

@@ -9,7 +9,7 @@
/* Hash search (array) */
int hashingSearchArray(unordered_map<int, int> map, int target) {
// Hash table's key: target element, value: index
// If the hash table does not contain this key, return -1
// If this key does not exist in the hash table, return -1
if (map.find(target) == map.end())
return -1;
return map[target];
@@ -18,7 +18,7 @@ int hashingSearchArray(unordered_map<int, int> map, int target) {
/* Hash search (linked list) */
ListNode *hashingSearchLinkedList(unordered_map<int, ListNode *> map, int target) {
// Hash table key: target node value, value: node object
// If the key is not in the hash table, return nullptr
// Return nullptr if key does not exist in hash table
if (map.find(target) == map.end())
return nullptr;
return map[target];
@@ -36,7 +36,7 @@ int main() {
map[nums[i]] = i; // key: element, value: index
}
int index = hashingSearchArray(map, target);
cout << "The index of target element 3 is " << index << endl;
cout << "Index of target element 3 = " << index << endl;
/* Hash search (linked list) */
ListNode *head = vecToLinkedList(nums);
@@ -47,7 +47,7 @@ int main() {
head = head->next;
}
ListNode *node = hashingSearchLinkedList(map1, target);
cout << "The corresponding node object for target node value 3 is " << node << endl;
cout << "Node object corresponding to target node value 3 is " << node << endl;
return 0;
}

12
en/codes/cpp/chapter_searching/linear_search.cpp
View File

@@ -10,24 +10,24 @@
int linearSearchArray(vector<int> &nums, int target) {
// Traverse array
for (int i = 0; i < nums.size(); i++) {
// Found the target element, thus return its index
// Found the target element, return its index
if (nums[i] == target)
return i;
}
// Did not find the target element, thus return -1
// Target element not found, return -1
return -1;
}
/* Linear search (linked list) */
ListNode *linearSearchLinkedList(ListNode *head, int target) {
// Traverse the list
// Traverse the linked list
while (head != nullptr) {
// Found the target node, return it
if (head->val == target)
return head;
head = head->next;
}
// If the target node is not found, return nullptr
// Target node not found, return nullptr
return nullptr;
}
@@ -38,12 +38,12 @@ int main() {
/* Perform linear search in array */
vector<int> nums = {1, 5, 3, 2, 4, 7, 5, 9, 10, 8};
int index = linearSearchArray(nums, target);
cout << "The index of target element 3 is " << index << endl;
cout << "Index of target element 3 = " << index << endl;
/* Perform linear search in linked list */
ListNode *head = vecToLinkedList(nums);
ListNode *node = linearSearchLinkedList(head, target);
cout << "The corresponding node object for target node value 3 is " << node << endl;
cout << "Node object corresponding to target node value 3 is " << node << endl;
return 0;
}

16
en/codes/cpp/chapter_searching/two_sum.cpp
View File

@@ -6,10 +6,10 @@
#include "../utils/common.hpp"
/* Method one: Brute force enumeration */
/* Method 1: Brute force enumeration */
vector<int> twoSumBruteForce(vector<int> &nums, int target) {
int size = nums.size();
// Two-layer loop, time complexity is O(n^2)
// Two nested loops, time complexity is O(n^2)
for (int i = 0; i < size - 1; i++) {
for (int j = i + 1; j < size; j++) {
if (nums[i] + nums[j] == target)
@@ -19,12 +19,12 @@ vector<int> twoSumBruteForce(vector<int> &nums, int target) {
return {};
}
/* Method two: Auxiliary hash table */
/* Method 2: Auxiliary hash table */
vector<int> twoSumHashTable(vector<int> &nums, int target) {
int size = nums.size();
// Auxiliary hash table, space complexity is O(n)
unordered_map<int, int> dic;
// Single-layer loop, time complexity is O(n)
// Single loop, time complexity is O(n)
for (int i = 0; i < size; i++) {
if (dic.find(target - nums[i]) != dic.end()) {
return {dic[target - nums[i]], i};
@@ -41,13 +41,13 @@ int main() {
int target = 13;
// ====== Driver Code ======
// Method one
// Method 1
vector<int> res = twoSumBruteForce(nums, target);
cout << "Method one res = ";
cout << "Method 1 res = ";
printVector(res);
// Method two
// Method 2
res = twoSumHashTable(nums, target);
cout << "Method two res = ";
cout << "Method 2 res = ";
printVector(res);
return 0;