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
2026-09-03 13:47:13 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,4 @@
+add_executable(binary_search binary_search.c)
+add_executable(two_sum two_sum.c)
+add_executable(binary_search_edge binary_search_edge.c)
+add_executable(binary_search_insertion binary_search_insertion.c)
@@ -0,0 +1,59 @@
+/**
+ * File: binary_search.c
+ * Created Time: 2023-03-18
+ * Author: Guanngxu (446678850@qq.com)
+ */
+
+#include "../utils/common.h"
+
+/* Binary search (closed interval on both sides) */
+int binarySearch(int *nums, int len, int target) {
+    // Initialize closed interval [0, n-1], i.e., i, j point to the first and last elements of the array
+    int i = 0, j = len - 1;
+    // Loop, exit when the search interval is empty (empty when i > j)
+    while (i <= 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 means target is in the interval [i, m-1]
+            j = m - 1;
+        else // Found the target element, return its index
+            return m;
+    }
+    // Target element not found, return -1
+    return -1;
+}
+
+/* Binary search (left-closed right-open interval) */
+int binarySearchLCRO(int *nums, int len, int target) {
+    // 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 = len;
+    // Loop, exit when the search interval is empty (empty when i = j)
+    while (i < 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 means target is in the interval [i, m)
+            j = m;
+        else // Found the target element, return its index
+            return m;
+    }
+    // Target element not found, return -1
+    return -1;
+}
+
+/* Driver Code */
+int main() {
+    int target = 6;
+    int nums[10] = {1, 3, 6, 8, 12, 15, 23, 26, 31, 35};
+
+    /* Binary search (closed interval on both sides) */
+    int index = binarySearch(nums, 10, target);
+    printf("Index of target element 6 = %d\n", index);
+
+    /* Binary search (left-closed right-open interval) */
+    index = binarySearchLCRO(nums, 10, target);
+    printf("Index of target element 6 = %d\n", index);
+
+    return 0;
+}
@@ -0,0 +1,67 @@
+/**
+ * File: binary_search_edge.c
+ * Created Time: 2023-09-09
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+/* Binary search for insertion point (with duplicate elements) */
+int binarySearchInsertion(int *nums, int numSize, int target) {
+    int i = 0, j = numSize - 1; // Initialize closed interval [0, n-1]
+    while (i <= j) {
+        int m = i + (j - i) / 2; // Calculate the midpoint index m
+        if (nums[m] < target) {
+            i = m + 1; // target is in the interval [m+1, j]
+        } else {
+            j = m - 1; // The first element less than target is in the interval [i, m-1]
+        }
+    }
+    // Return insertion point i
+    return i;
+}
+
+/* Binary search for the leftmost target */
+int binarySearchLeftEdge(int *nums, int numSize, int target) {
+    // Equivalent to finding the insertion point of target
+    int i = binarySearchInsertion(nums, numSize, target);
+    // Target not found, return -1
+    if (i == numSize || nums[i] != target) {
+        return -1;
+    }
+    // Found target, return index i
+    return i;
+}
+
+/* Binary search for the rightmost target */
+int binarySearchRightEdge(int *nums, int numSize, int target) {
+    // Convert to finding the leftmost target + 1
+    int i = binarySearchInsertion(nums, numSize, target + 1);
+    // j points to the rightmost target, i points to the first element greater than target
+    int j = i - 1;
+    // Target not found, return -1
+    if (j == -1 || nums[j] != target) {
+        return -1;
+    }
+    // Found target, return index j
+    return j;
+}
+
+/* Driver Code */
+int main() {
+    // Array with duplicate elements
+    int nums[] = {1, 3, 6, 6, 6, 6, 6, 10, 12, 15};
+    printf("\nArray nums = ");
+    printArray(nums, sizeof(nums) / sizeof(nums[0]));
+
+    // Binary search left and right boundaries
+    int targets[] = {6, 7};
+    for (int i = 0; i < sizeof(targets) / sizeof(targets[0]); i++) {
+        int index = binarySearchLeftEdge(nums, sizeof(nums) / sizeof(nums[0]), targets[i]);
+        printf("Leftmost element %d index is %d\n", targets[i], index);
+        index = binarySearchRightEdge(nums, sizeof(nums) / sizeof(nums[0]), targets[i]);
+        printf("Rightmost element %d index is %d\n", targets[i], index);
+    }
+
+    return 0;
+}
@@ -0,0 +1,68 @@
+/**
+ * File: binary_search_insertion.c
+ * Created Time: 2023-09-09
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+/* Binary search for insertion point (no duplicate elements) */
+int binarySearchInsertionSimple(int *nums, int numSize, int target) {
+    int i = 0, j = numSize - 1; // Initialize closed interval [0, n-1]
+    while (i <= j) {
+        int m = i + (j - i) / 2; // Calculate the midpoint index m
+        if (nums[m] < target) {
+            i = m + 1; // target is in the interval [m+1, j]
+        } else if (nums[m] > target) {
+            j = m - 1; // target is in the interval [i, m-1]
+        } else {
+            return m; // Found target, return insertion point m
+        }
+    }
+    // Target not found, return insertion point i
+    return i;
+}
+
+/* Binary search for insertion point (with duplicate elements) */
+int binarySearchInsertion(int *nums, int numSize, int target) {
+    int i = 0, j = numSize - 1; // Initialize closed interval [0, n-1]
+    while (i <= j) {
+        int m = i + (j - i) / 2; // Calculate the midpoint index m
+        if (nums[m] < target) {
+            i = m + 1; // target is in the interval [m+1, j]
+        } else if (nums[m] > target) {
+            j = m - 1; // target is in the interval [i, m-1]
+        } else {
+            j = m - 1; // The first element less than target is in the interval [i, m-1]
+        }
+    }
+    // Return insertion point i
+    return i;
+}
+
+/* Driver Code */
+int main() {
+    // Array without duplicate elements
+    int nums1[] = {1, 3, 6, 8, 12, 15, 23, 26, 31, 35};
+    printf("\nArray nums = ");
+    printArray(nums1, sizeof(nums1) / sizeof(nums1[0]));
+    // Binary search for insertion point
+    int targets1[] = {6, 9};
+    for (int i = 0; i < sizeof(targets1) / sizeof(targets1[0]); i++) {
+        int index = binarySearchInsertionSimple(nums1, sizeof(nums1) / sizeof(nums1[0]), targets1[i]);
+        printf("Insertion point index for element %d is %d\n", targets1[i], index);
+    }
+
+    // Array with duplicate elements
+    int nums2[] = {1, 3, 6, 6, 6, 6, 6, 10, 12, 15};
+    printf("\nArray nums = ");
+    printArray(nums2, sizeof(nums2) / sizeof(nums2[0]));
+    // Binary search for insertion point
+    int targets2[] = {2, 6, 20};
+    for (int i = 0; i < sizeof(targets2) / sizeof(int); i++) {
+        int index = binarySearchInsertion(nums2, sizeof(nums2) / sizeof(nums2[0]), targets2[i]);
+        printf("Insertion point index for element %d is %d\n", targets2[i], index);
+    }
+
+    return 0;
+}
@@ -0,0 +1,86 @@
+/**
+ * File: two_sum.c
+ * Created Time: 2023-01-19
+ * Author: Reanon (793584285@qq.com)
+ */
+
+#include "../utils/common.h"
+
+/* Method 1: Brute force enumeration */
+int *twoSumBruteForce(int *nums, int numsSize, int target, int *returnSize) {
+    for (int i = 0; i < numsSize; ++i) {
+        for (int j = i + 1; j < numsSize; ++j) {
+            if (nums[i] + nums[j] == target) {
+                int *res = malloc(sizeof(int) * 2);
+                res[0] = i, res[1] = j;
+                *returnSize = 2;
+                return res;
+            }
+        }
+    }
+    *returnSize = 0;
+    return NULL;
+}
+
+/* Hash table */
+typedef struct {
+    int key;
+    int val;
+    UT_hash_handle hh; // Implemented using uthash.h
+} HashTable;
+
+/* Hash table lookup */
+HashTable *find(HashTable *h, int key) {
+    HashTable *tmp;
+    HASH_FIND_INT(h, &key, tmp);
+    return tmp;
+}
+
+/* Hash table element insertion */
+void insert(HashTable **h, int key, int val) {
+    HashTable *t = find(*h, key);
+    if (t == NULL) {
+        HashTable *tmp = malloc(sizeof(HashTable));
+        tmp->key = key, tmp->val = val;
+        HASH_ADD_INT(*h, key, tmp);
+    } else {
+        t->val = val;
+    }
+}
+
+/* Method 2: Auxiliary hash table */
+int *twoSumHashTable(int *nums, int numsSize, int target, int *returnSize) {
+    HashTable *hashtable = NULL;
+    for (int i = 0; i < numsSize; i++) {
+        HashTable *t = find(hashtable, target - nums[i]);
+        if (t != NULL) {
+            int *res = malloc(sizeof(int) * 2);
+            res[0] = t->val, res[1] = i;
+            *returnSize = 2;
+            return res;
+        }
+        insert(&hashtable, nums[i], i);
+    }
+    *returnSize = 0;
+    return NULL;
+}
+
+/* Driver Code */
+int main() {
+    // ======= Test Case =======
+    int nums[] = {2, 7, 11, 15};
+    int target = 13;
+    // ====== Driver Code ======
+    int returnSize;
+    int *res = twoSumBruteForce(nums, sizeof(nums) / sizeof(int), target, &returnSize);
+    // Method 1
+    printf("Method 1 res = ");
+    printArray(res, returnSize);
+
+    // Method 2
+    res = twoSumHashTable(nums, sizeof(nums) / sizeof(int), target, &returnSize);
+    printf("Method 2 res = ");
+    printArray(res, returnSize);
+
+    return 0;
+}