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-07-11 15:06:07 +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,48 @@
+/**
+ * File: coin_change_greedy.js
+ * Created Time: 2023-09-02
+ * Author: Justin (xiefahit@gmail.com)
+ */
+
+/* Coin change: Greedy algorithm */
+function coinChangeGreedy(coins, amt) {
+    // Assume coins array is sorted
+    let i = coins.length - 1;
+    let count = 0;
+    // Loop to make greedy choices until no remaining amount
+    while (amt > 0) {
+        // Find the coin that is less than and closest to the remaining amount
+        while (i > 0 && coins[i] > amt) {
+            i--;
+        }
+        // Choose coins[i]
+        amt -= coins[i];
+        count++;
+    }
+    // If no feasible solution is found, return -1
+    return amt === 0 ? count : -1;
+}
+
+/* Driver Code */
+// Greedy algorithm: Can guarantee finding the global optimal solution
+let coins = [1, 5, 10, 20, 50, 100];
+let amt = 186;
+let res = coinChangeGreedy(coins, amt);
+console.log(`\ncoins = ${coins}, amt = ${amt}`);
+console.log(`Minimum coins needed to make ${amt} is ${res}`);
+
+// Greedy algorithm: Cannot guarantee finding the global optimal solution
+coins = [1, 20, 50];
+amt = 60;
+res = coinChangeGreedy(coins, amt);
+console.log(`\ncoins = ${coins}, amt = ${amt}`);
+console.log(`Minimum coins needed to make ${amt} is ${res}`);
+console.log('Actually the minimum number needed is 3, i.e., 20 + 20 + 20');
+
+// Greedy algorithm: Cannot guarantee finding the global optimal solution
+coins = [1, 49, 50];
+amt = 98;
+res = coinChangeGreedy(coins, amt);
+console.log(`\ncoins = ${coins}, amt = ${amt}`);
+console.log(`Minimum coins needed to make ${amt} is ${res}`);
+console.log('Actually the minimum number needed is 2, i.e., 49 + 49');
@@ -0,0 +1,46 @@
+/**
+ * File: fractional_knapsack.js
+ * Created Time: 2023-09-02
+ * Author: Justin (xiefahit@gmail.com)
+ */
+
+/* Item */
+class Item {
+    constructor(w, v) {
+        this.w = w; // Item weight
+        this.v = v; // Item value
+    }
+}
+
+/* Fractional knapsack: Greedy algorithm */
+function fractionalKnapsack(wgt, val, cap) {
+    // Create item list with two attributes: weight, value
+    const items = wgt.map((w, i) => new Item(w, val[i]));
+    // Sort by unit value item.v / item.w from high to low
+    items.sort((a, b) => b.v / b.w - a.v / a.w);
+    // Loop for greedy selection
+    let res = 0;
+    for (const item of items) {
+        if (item.w <= cap) {
+            // If remaining capacity is sufficient, put the entire current item into the knapsack
+            res += item.v;
+            cap -= item.w;
+        } else {
+            // If remaining capacity is insufficient, put part of the current item into the knapsack
+            res += (item.v / item.w) * cap;
+            // No remaining capacity, so break out of the loop
+            break;
+        }
+    }
+    return res;
+}
+
+/* Driver Code */
+const wgt = [10, 20, 30, 40, 50];
+const val = [50, 120, 150, 210, 240];
+const cap = 50;
+const n = wgt.length;
+
+// Greedy algorithm
+const res = fractionalKnapsack(wgt, val, cap);
+console.log(`Maximum item value not exceeding knapsack capacity is ${res}`);
@@ -0,0 +1,34 @@
+/**
+ * File: max_capacity.js
+ * Created Time: 2023-09-02
+ * Author: Justin (xiefahit@gmail.com)
+ */
+
+/* Max capacity: Greedy algorithm */
+function maxCapacity(ht) {
+    // Initialize i, j to be at both ends of the array
+    let i = 0,
+        j = ht.length - 1;
+    // Initial max capacity is 0
+    let res = 0;
+    // Loop for greedy selection until the two boards meet
+    while (i < j) {
+        // Update max capacity
+        const cap = Math.min(ht[i], ht[j]) * (j - i);
+        res = Math.max(res, cap);
+        // Move the shorter board inward
+        if (ht[i] < ht[j]) {
+            i += 1;
+        } else {
+            j -= 1;
+        }
+    }
+    return res;
+}
+
+/* Driver Code */
+const ht = [3, 8, 5, 2, 7, 7, 3, 4];
+
+// Greedy algorithm
+const res = maxCapacity(ht);
+console.log(`Maximum capacity is ${res}`);
@@ -0,0 +1,33 @@
+/**
+ * File: max_product_cutting.js
+ * Created Time: 2023-09-02
+ * Author: Justin (xiefahit@gmail.com)
+ */
+
+/* Max product cutting: Greedy algorithm */
+function maxProductCutting(n) {
+    // When n <= 3, must cut out a 1
+    if (n <= 3) {
+        return 1 * (n - 1);
+    }
+    // Greedily cut out 3, a is the number of 3s, b is the remainder
+    let a = Math.floor(n / 3);
+    let b = n % 3;
+    if (b === 1) {
+        // When the remainder is 1, convert a pair of 1 * 3 to 2 * 2
+        return Math.pow(3, a - 1) * 2 * 2;
+    }
+    if (b === 2) {
+        // When the remainder is 2, do nothing
+        return Math.pow(3, a) * 2;
+    }
+    // When the remainder is 0, do nothing
+    return Math.pow(3, a);
+}
+
+/* Driver Code */
+let n = 58;
+
+// Greedy algorithm
+let res = maxProductCutting(n);
+console.log(`Maximum cutting product is ${res}`);