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-08-14 20:50:58 +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,54 @@
+/**
+* File: coin_change_greedy.cs
+* Created Time: 2023-07-21
+* Author: hpstory (hpstory1024@163.com)
+*/
+
+namespace hello_algo.chapter_greedy;
+
+public class coin_change_greedy {
+    /* Coin change: Greedy algorithm */
+    int CoinChangeGreedy(int[] coins, int amt) {
+        // Assume coins list is sorted
+        int i = coins.Length - 1;
+        int 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;
+    }
+
+    [Test]
+    public void Test() {
+        // Greedy algorithm: Can guarantee finding the global optimal solution
+        int[] coins = [1, 5, 10, 20, 50, 100];
+        int amt = 186;
+        int res = CoinChangeGreedy(coins, amt);
+        Console.WriteLine("\ncoins = " + coins.PrintList() + ", amt = " + amt);
+        Console.WriteLine("To make " + amt + ", minimum number of coins needed is " + res);
+
+        // Greedy algorithm: Cannot guarantee finding the global optimal solution
+        coins = [1, 20, 50];
+        amt = 60;
+        res = CoinChangeGreedy(coins, amt);
+        Console.WriteLine("\ncoins = " + coins.PrintList() + ", amt = " + amt);
+        Console.WriteLine("To make " + amt + ", minimum number of coins needed is " + res);
+        Console.WriteLine("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.WriteLine("\ncoins = " + coins.PrintList() + ", amt = " + amt);
+        Console.WriteLine("To make " + amt + ", minimum number of coins needed is " + res);
+        Console.WriteLine("Actually the minimum number needed is 2, i.e., 49 + 49");
+    }
+}
@@ -0,0 +1,52 @@
+/**
+* File: fractional_knapsack.cs
+* Created Time: 2023-07-21
+* Author: hpstory (hpstory1024@163.com)
+*/
+
+namespace hello_algo.chapter_greedy;
+
+/* Item */
+class Item(int w, int v) {
+    public int w = w; // Item weight
+    public int v = v; // Item value
+}
+
+public class fractional_knapsack {
+    /* Fractional knapsack: Greedy algorithm */
+    double FractionalKnapsack(int[] wgt, int[] val, int cap) {
+        // Create item list with two attributes: weight, value
+        Item[] items = new Item[wgt.Length];
+        for (int i = 0; i < wgt.Length; i++) {
+            items[i] = new Item(wgt[i], val[i]);
+        }
+        // Sort by unit value item.v / item.w from high to low
+        Array.Sort(items, (x, y) => (y.v / y.w).CompareTo(x.v / x.w));
+        // Loop for greedy selection
+        double res = 0;
+        foreach (Item item in 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 += (double)item.v / item.w * cap;
+                // No remaining capacity, so break out of the loop
+                break;
+            }
+        }
+        return res;
+    }
+
+    [Test]
+    public void Test() {
+        int[] wgt = [10, 20, 30, 40, 50];
+        int[] val = [50, 120, 150, 210, 240];
+        int cap = 50;
+
+        // Greedy algorithm
+        double res = FractionalKnapsack(wgt, val, cap);
+        Console.WriteLine("Maximum item value not exceeding knapsack capacity is " + res);
+    }
+}
@@ -0,0 +1,39 @@
+/**
+* File: max_capacity.cs
+* Created Time: 2023-07-21
+* Author: hpstory (hpstory1024@163.com)
+*/
+
+namespace hello_algo.chapter_greedy;
+
+public class max_capacity {
+    /* Max capacity: Greedy algorithm */
+    int MaxCapacity(int[] ht) {
+        // Initialize i, j to be at both ends of the array
+        int i = 0, j = ht.Length - 1;
+        // Initial max capacity is 0
+        int res = 0;
+        // Loop for greedy selection until the two boards meet
+        while (i < j) {
+            // Update max capacity
+            int 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++;
+            } else {
+                j--;
+            }
+        }
+        return res;
+    }
+
+    [Test]
+    public void Test() {
+        int[] ht = [3, 8, 5, 2, 7, 7, 3, 4];
+
+        // Greedy algorithm
+        int res = MaxCapacity(ht);
+        Console.WriteLine("Maximum capacity is " + res);
+    }
+}
@@ -0,0 +1,39 @@
+/**
+* File: max_product_cutting.cs
+* Created Time: 2023-07-21
+* Author: hpstory (hpstory1024@163.com)
+*/
+
+namespace hello_algo.chapter_greedy;
+
+public class max_product_cutting {
+    /* Max product cutting: Greedy algorithm */
+    int MaxProductCutting(int 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
+        int a = n / 3;
+        int b = n % 3;
+        if (b == 1) {
+            // When the remainder is 1, convert a pair of 1 * 3 to 2 * 2
+            return (int)Math.Pow(3, a - 1) * 2 * 2;
+        }
+        if (b == 2) {
+            // When the remainder is 2, do nothing
+            return (int)Math.Pow(3, a) * 2;
+        }
+        // When the remainder is 0, do nothing
+        return (int)Math.Pow(3, a);
+    }
+
+    [Test]
+    public void Test() {
+        int n = 58;
+
+        // Greedy algorithm
+        int res = MaxProductCutting(n);
+        Console.WriteLine("Maximum cutting product is" + res);
+    }
+}