xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-11 06:56:06 +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_greedy/coin_change_greedy.java
+12 -12
View File
@@ -9,14 +9,14 @@ package chapter_greedy;
import java.util.Arrays;
public class coin_change_greedy {
/* Coin change: Greedy */
/* Coin change: Greedy algorithm */
static int coinChangeGreedy(int[] coins, int amt) {
// Assume coins list is ordered
// Assume coins list is sorted
int i = coins.length - 1;
int count = 0;
// Loop for greedy selection until no remaining amount
// Loop to make greedy choices until no remaining amount
while (amt > 0) {
// Find the smallest coin close to and less than the remaining amount
// Find the coin that is less than and closest to the remaining amount
while (i > 0 && coins[i] > amt) {
i--;
}
@@ -29,27 +29,27 @@ public class coin_change_greedy {
}
public static void main(String[] args) {
// Greedy: can ensure finding a global optimal solution
// 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);
System.out.println("\ncoins = " + Arrays.toString(coins) + ", amt = " + amt);
System.out.println("The minimum number of coins required to make up " + amt + " is " + res);
System.out.println("Minimum number of coins needed to make " + amt + " is " + res);
// Greedy: cannot ensure finding a global optimal solution
// Greedy algorithm: Cannot guarantee finding the global optimal solution
coins = new int[] { 1, 20, 50 };
amt = 60;
res = coinChangeGreedy(coins, amt);
System.out.println("\ncoins = " + Arrays.toString(coins) + ", amt = " + amt);
System.out.println("The minimum number of coins required to make up " + amt + " is " + res);
System.out.println("In reality, the minimum number needed is 3, i.e., 20 + 20 + 20");
System.out.println("Minimum number of coins needed to make " + amt + " is " + res);
System.out.println("Actually the minimum number needed is 3, i.e., 20 + 20 + 20");
// Greedy: cannot ensure finding a global optimal solution
// Greedy algorithm: Cannot guarantee finding the global optimal solution
coins = new int[] { 1, 49, 50 };
amt = 98;
res = coinChangeGreedy(coins, amt);
System.out.println("\ncoins = " + Arrays.toString(coins) + ", amt = " + amt);
System.out.println("The minimum number of coins required to make up " + amt + " is " + res);
System.out.println("In reality, the minimum number needed is 2, i.e., 49 + 49");
System.out.println("Minimum number of coins needed to make " + amt + " is " + res);
System.out.println("Actually the minimum number needed is 2, i.e., 49 + 49");
}
}
en/codes/java/chapter_greedy/fractional_knapsack.java
+6 -6
View File
@@ -21,9 +21,9 @@ class Item {
}
public class fractional_knapsack {
/* Fractional knapsack: Greedy */
/* Fractional knapsack: Greedy algorithm */
static double fractionalKnapsack(int[] wgt, int[] val, int cap) {
// Create an item list, containing two properties: weight, value
// 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]);
@@ -34,13 +34,13 @@ public class fractional_knapsack {
double res = 0;
for (Item item : items) {
if (item.w <= cap) {
// If the remaining capacity is sufficient, put the entire item into the knapsack
// If remaining capacity is sufficient, put the entire current item into the knapsack
res += item.v;
cap -= item.w;
} else {
// If the remaining capacity is insufficient, put part of the item into the knapsack
// If remaining capacity is insufficient, put part of the current item into the knapsack
res += (double) item.v / item.w * cap;
// No remaining capacity left, thus break the loop
// No remaining capacity, so break out of the loop
break;
}
}
@@ -54,6 +54,6 @@ public class fractional_knapsack {
// Greedy algorithm
double res = fractionalKnapsack(wgt, val, cap);
System.out.println("The maximum value within the bag capacity is " + res);
System.out.println("Maximum item value not exceeding knapsack capacity is " + res);
}
}
en/codes/java/chapter_greedy/max_capacity.java
+5 -5
View File
@@ -7,15 +7,15 @@
package chapter_greedy;
public class max_capacity {
/* Maximum capacity: Greedy */
/* Max capacity: Greedy algorithm */
static int maxCapacity(int[] ht) {
// Initialize i, j, making them split the array at both ends
// Initialize i, j to be at both ends of the array
int i = 0, j = ht.length - 1;
// Initial maximum capacity is 0
// Initial max capacity is 0
int res = 0;
// Loop for greedy selection until the two boards meet
while (i < j) {
// Update maximum capacity
// Update max capacity
int cap = Math.min(ht[i], ht[j]) * (j - i);
res = Math.max(res, cap);
// Move the shorter board inward
@@ -33,6 +33,6 @@ public class max_capacity {
// Greedy algorithm
int res = maxCapacity(ht);
System.out.println("The maximum capacity is " + res);
System.out.println("Maximum capacity is " + res);
}
}
en/codes/java/chapter_greedy/max_product_cutting.java
+4 -4
View File
@@ -9,17 +9,17 @@ package chapter_greedy;
import java.lang.Math;
public class max_product_cutting {
/* Maximum product of cutting: Greedy */
/* Max product cutting: Greedy algorithm */
public static int maxProductCutting(int n) {
// When n <= 3, must cut out a 1
if (n <= 3) {
return 1 * (n - 1);
}
// Greedy cut out 3s, a is the number of 3s, b is the remainder
// 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 into 2 * 2
// 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) {
@@ -35,6 +35,6 @@ public class max_product_cutting {
// Greedy algorithm
int res = maxProductCutting(n);
System.out.println("The maximum product of division is " + res);
System.out.println("Maximum cutting product is " + res);
}
}