xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-11 23:16:07 +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/java/chapter_searching/binary_search.java
+20 -20
View File
@@ -7,39 +7,39 @@
package chapter_searching;
public class binary_search {
/* Binary search (double closed interval) */
/* Binary search (closed interval on both sides) */
static int binarySearch(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.length - 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) */
static int binarySearchLCRO(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.length;
// 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,12 +47,12 @@ public class binary_search {
int target = 6;
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);
System.out.println("Index of target element 6 =" + index);
System.out.println("Index of target element 6 = " + index);
/* Binary search (left closed right open interval) */
/* Binary search (left-closed right-open interval) */
index = binarySearchLCRO(nums, target);
System.out.println("Index of target element 6 =" + index);
System.out.println("Index of target element 6 = " + index);
}
}
en/codes/java/chapter_searching/binary_search_edge.java
+5 -5
View File
@@ -11,7 +11,7 @@ public class binary_search_edge {
static int binarySearchLeftEdge(int[] nums, int target) {
// Equivalent to finding the insertion point of target
int i = binary_search_insertion.binarySearchInsertion(nums, target);
// Did not find target, thus return -1
// Target not found, return -1
if (i == nums.length || nums[i] != target) {
return -1;
}
@@ -25,7 +25,7 @@ public class binary_search_edge {
int i = binary_search_insertion.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;
}
@@ -38,12 +38,12 @@ public class binary_search_edge {
int[] nums = { 1, 3, 6, 6, 6, 6, 6, 10, 12, 15 };
System.out.println("\nArray nums = " + java.util.Arrays.toString(nums));
// Binary search for left and right boundaries
// Binary search left and right boundaries
for (int target : new int[] { 6, 7 }) {
int index = binarySearchLeftEdge(nums, target);
System.out.println("The leftmost index of element " + target + " is " + index);
System.out.println("Index of leftmost element " + target + " is " + index);
index = binarySearchRightEdge(nums, target);
System.out.println("The rightmost index of element " + target + " is " + index);
System.out.println("Index of rightmost element " + target + " is " + index);
}
}
}
en/codes/java/chapter_searching/binary_search_insertion.java
+12 -12
View File
@@ -9,32 +9,32 @@ package chapter_searching;
class binary_search_insertion {
/* Binary search for insertion point (no duplicate elements) */
static int binarySearchInsertionSimple(int[] nums, int target) {
int i = 0, j = nums.length - 1; // Initialize double closed interval [0, n-1]
int i = 0, j = nums.length - 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) */
static int binarySearchInsertion(int[] nums, int target) {
int i = 0, j = nums.length - 1; // Initialize double closed interval [0, n-1]
int i = 0, j = nums.length - 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
@@ -48,7 +48,7 @@ class binary_search_insertion {
// Binary search for insertion point
for (int target : new int[] { 6, 9 }) {
int index = binarySearchInsertionSimple(nums, target);
System.out.println("The insertion point index for element " + target + " is " + index);
System.out.println("Insertion point index for element " + target + " is " + index);
}
// Array with duplicate elements
@@ -57,7 +57,7 @@ class binary_search_insertion {
// Binary search for insertion point
for (int target : new int[] { 2, 6, 20 }) {
int index = binarySearchInsertion(nums, target);
System.out.println("The insertion point index for element " + target + " is " + index);
System.out.println("Insertion point index for element " + target + " is " + index);
}
}
}
en/codes/java/chapter_searching/hashing_search.java
+4 -4
View File
@@ -13,14 +13,14 @@ public class hashing_search {
/* Hash search (array) */
static int hashingSearchArray(Map<Integer, Integer> 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
return map.getOrDefault(target, -1);
}
/* Hash search (linked list) */
static ListNode hashingSearchLinkedList(Map<Integer, ListNode> map, int target) {
// Hash table key: target node value, value: node object
// If the key is not in the hash table, return null
// If key is not in hash table, return null
return map.getOrDefault(target, null);
}
@@ -35,7 +35,7 @@ public class hashing_search {
map.put(nums[i], i); // key: element, value: index
}
int index = hashingSearchArray(map, target);
System.out.println("The index of target element 3 is " + index);
System.out.println("Index of target element 3 = " + index);
/* Hash search (linked list) */
ListNode head = ListNode.arrToLinkedList(nums);
@@ -46,6 +46,6 @@ public class hashing_search {
head = head.next;
}
ListNode node = hashingSearchLinkedList(map1, target);
System.out.println("The corresponding node object for target node value 3 is " + node);
System.out.println("Node object corresponding to target node value 3 is " + node);
}
}
en/codes/java/chapter_searching/linear_search.java
+6 -6
View File
@@ -13,24 +13,24 @@ public class linear_search {
static int linearSearchArray(int[] nums, int target) {
// Traverse array
for (int i = 0; i < nums.length; 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) */
static ListNode linearSearchLinkedList(ListNode head, int target) {
// Traverse the list
// Traverse the linked list
while (head != null) {
// Found the target node, return it
if (head.val == target)
return head;
head = head.next;
}
// If the target node is not found, return null
// Target node not found, return null
return null;
}
@@ -40,11 +40,11 @@ public class linear_search {
/* Perform linear search in array */
int[] nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
int index = linearSearchArray(nums, target);
System.out.println("The index of target element 3 is " + index);
System.out.println("Index of target element 3 = " + index);
/* Perform linear search in linked list */
ListNode head = ListNode.arrToLinkedList(nums);
ListNode node = linearSearchLinkedList(head, target);
System.out.println("The corresponding node object for target node value 3 is " + node);
System.out.println("Node object corresponding to target node value 3 is " + node);
}
}
en/codes/java/chapter_searching/two_sum.java
+8 -8
View File
@@ -9,10 +9,10 @@ package chapter_searching;
import java.util.*;
public class two_sum {
/* Method one: Brute force enumeration */
/* Method 1: Brute force enumeration */
static int[] twoSumBruteForce(int[] nums, int target) {
int size = nums.length;
// 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)
@@ -22,12 +22,12 @@ public class two_sum {
return new int[0];
}
/* Method two: Auxiliary hash table */
/* Method 2: Auxiliary hash table */
static int[] twoSumHashTable(int[] nums, int target) {
int size = nums.length;
// Auxiliary hash table, space complexity is O(n)
Map<Integer, Integer> dic = new HashMap<>();
// Single-layer loop, time complexity is O(n)
// Single loop, time complexity is O(n)
for (int i = 0; i < size; i++) {
if (dic.containsKey(target - nums[i])) {
return new int[] { dic.get(target - nums[i]), i };
@@ -43,11 +43,11 @@ public class two_sum {
int target = 13;
// ====== Driver Code ======
// Method one
// Method 1
int[] res = twoSumBruteForce(nums, target);
System.out.println("Method one res = " + Arrays.toString(res));
// Method two
System.out.println("Method 1 res = " + Arrays.toString(res));
// Method 2
res = twoSumHashTable(nums, target);
System.out.println("Method two res = " + Arrays.toString(res));
System.out.println("Method 2 res = " + Arrays.toString(res));
}
}