xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-06 04:34:20 +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_backtracking/n_queens.java
+12 -12
View File
@@ -9,7 +9,7 @@ package chapter_backtracking;
import java.util.*;
public class n_queens {
/* Backtracking algorithm: n queens */
/* Backtracking algorithm: N queens */
public static void backtrack(int row, int n, List<List<String>> state, List<List<List<String>>> res,
boolean[] cols, boolean[] diags1, boolean[] diags2) {
// When all rows are placed, record the solution
@@ -23,26 +23,26 @@ public class n_queens {
}
// Traverse all columns
for (int col = 0; col < n; col++) {
// Calculate the main and minor diagonals corresponding to the cell
// Calculate the main diagonal and anti-diagonal corresponding to this cell
int diag1 = row - col + n - 1;
int diag2 = row + col;
// Pruning: do not allow queens on the column, main diagonal, or minor diagonal of the cell
// Pruning: do not allow queens to exist in the column, main diagonal, and anti-diagonal of this cell
if (!cols[col] && !diags1[diag1] && !diags2[diag2]) {
// Attempt: place the queen in the cell
// Attempt: place the queen in this cell
state.get(row).set(col, "Q");
cols[col] = diags1[diag1] = diags2[diag2] = true;
// Place the next row
backtrack(row + 1, n, state, res, cols, diags1, diags2);
// Retract: restore the cell to an empty spot
// Backtrack: restore this cell to an empty cell
state.get(row).set(col, "#");
cols[col] = diags1[diag1] = diags2[diag2] = false;
}
}
}
/* Solve n queens */
/* Solve N queens */
public static List<List<List<String>>> nQueens(int n) {
// Initialize an n*n size chessboard, where 'Q' represents the queen and '#' represents an empty spot
// Initialize an n*n chessboard, where 'Q' represents a queen and '#' represents an empty cell
List<List<String>> state = new ArrayList<>();
for (int i = 0; i < n; i++) {
List<String> row = new ArrayList<>();
@@ -51,9 +51,9 @@ public class n_queens {
}
state.add(row);
}
boolean[] cols = new boolean[n]; // Record columns with queens
boolean[] diags1 = new boolean[2 * n - 1]; // Record main diagonals with queens
boolean[] diags2 = new boolean[2 * n - 1]; // Record minor diagonals with queens
boolean[] cols = new boolean[n]; // Record whether there is a queen in the column
boolean[] diags1 = new boolean[2 * n - 1]; // Record whether there is a queen on the main diagonal
boolean[] diags2 = new boolean[2 * n - 1]; // Record whether there is a queen on the anti-diagonal
List<List<List<String>>> res = new ArrayList<>();
backtrack(0, n, state, res, cols, diags1, diags2);
@@ -65,8 +65,8 @@ public class n_queens {
int n = 4;
List<List<List<String>>> res = nQueens(n);
System.out.println("Input the dimensions of the chessboard as " + n);
System.out.println("Total number of queen placement solutions = " + res.size());
System.out.println("Input board size is " + n);
System.out.println("Total queen placement solutions: " + res.size() + "");
for (List<List<String>> state : res) {
System.out.println("--------------------");
for (List<String> row : state) {
en/codes/java/chapter_backtracking/permutations_i.java
+4 -4
View File
@@ -9,7 +9,7 @@ package chapter_backtracking;
import java.util.*;
public class permutations_i {
/* Backtracking algorithm: Permutation I */
/* Backtracking algorithm: Permutations I */
public static void backtrack(List<Integer> state, int[] choices, boolean[] selected, List<List<Integer>> res) {
// When the state length equals the number of elements, record the solution
if (state.size() == choices.length) {
@@ -21,19 +21,19 @@ public class permutations_i {
int choice = choices[i];
// Pruning: do not allow repeated selection of elements
if (!selected[i]) {
// Attempt: make a choice, update the state
// Attempt: make choice, update state
selected[i] = true;
state.add(choice);
// Proceed to the next round of selection
backtrack(state, choices, selected, res);
// Retract: undo the choice, restore to the previous state
// Backtrack: undo choice, restore to previous state
selected[i] = false;
state.remove(state.size() - 1);
}
}
}
/* Permutation I */
/* Permutations I */
static List<List<Integer>> permutationsI(int[] nums) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
backtrack(new ArrayList<Integer>(), nums, new boolean[nums.length], res);
en/codes/java/chapter_backtracking/permutations_ii.java
+5 -5
View File
@@ -9,7 +9,7 @@ package chapter_backtracking;
import java.util.*;
public class permutations_ii {
/* Backtracking algorithm: Permutation II */
/* Backtracking algorithm: Permutations II */
static void backtrack(List<Integer> state, int[] choices, boolean[] selected, List<List<Integer>> res) {
// When the state length equals the number of elements, record the solution
if (state.size() == choices.length) {
@@ -22,20 +22,20 @@ public class permutations_ii {
int choice = choices[i];
// Pruning: do not allow repeated selection of elements and do not allow repeated selection of equal elements
if (!selected[i] && !duplicated.contains(choice)) {
// Attempt: make a choice, update the state
duplicated.add(choice); // Record selected element values
// Attempt: make choice, update state
duplicated.add(choice); // Record the selected element value
selected[i] = true;
state.add(choice);
// Proceed to the next round of selection
backtrack(state, choices, selected, res);
// Retract: undo the choice, restore to the previous state
// Backtrack: undo choice, restore to previous state
selected[i] = false;
state.remove(state.size() - 1);
}
}
}
/* Permutation II */
/* Permutations II */
static List<List<Integer>> permutationsII(int[] nums) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
backtrack(new ArrayList<Integer>(), nums, new boolean[nums.length], res);
en/codes/java/chapter_backtracking/preorder_traversal_i_compact.java
+2 -2
View File
@@ -12,7 +12,7 @@ import java.util.*;
public class preorder_traversal_i_compact {
static List<TreeNode> res;
/* Pre-order traversal: Example one */
/* Preorder traversal: Example 1 */
static void preOrder(TreeNode root) {
if (root == null) {
return;
@@ -30,7 +30,7 @@ public class preorder_traversal_i_compact {
System.out.println("\nInitialize binary tree");
PrintUtil.printTree(root);
// Pre-order traversal
// Preorder traversal
res = new ArrayList<>();
preOrder(root);
en/codes/java/chapter_backtracking/preorder_traversal_ii_compact.java
+4 -4
View File
@@ -13,7 +13,7 @@ public class preorder_traversal_ii_compact {
static List<TreeNode> path;
static List<List<TreeNode>> res;
/* Pre-order traversal: Example two */
/* Preorder traversal: Example 2 */
static void preOrder(TreeNode root) {
if (root == null) {
return;
@@ -26,7 +26,7 @@ public class preorder_traversal_ii_compact {
}
preOrder(root.left);
preOrder(root.right);
// Retract
// Backtrack
path.remove(path.size() - 1);
}
@@ -35,12 +35,12 @@ public class preorder_traversal_ii_compact {
System.out.println("\nInitialize binary tree");
PrintUtil.printTree(root);
// Pre-order traversal
// Preorder traversal
path = new ArrayList<>();
res = new ArrayList<>();
preOrder(root);
System.out.println("\nOutput all root-to-node 7 paths");
System.out.println("\nOutput all paths from root node to node 7");
for (List<TreeNode> path : res) {
List<Integer> vals = new ArrayList<>();
for (TreeNode node : path) {
en/codes/java/chapter_backtracking/preorder_traversal_iii_compact.java
+4 -4
View File
@@ -13,7 +13,7 @@ public class preorder_traversal_iii_compact {
static List<TreeNode> path;
static List<List<TreeNode>> res;
/* Pre-order traversal: Example three */
/* Preorder traversal: Example 3 */
static void preOrder(TreeNode root) {
// Pruning
if (root == null || root.val == 3) {
@@ -27,7 +27,7 @@ public class preorder_traversal_iii_compact {
}
preOrder(root.left);
preOrder(root.right);
// Retract
// Backtrack
path.remove(path.size() - 1);
}
@@ -36,12 +36,12 @@ public class preorder_traversal_iii_compact {
System.out.println("\nInitialize binary tree");
PrintUtil.printTree(root);
// Pre-order traversal
// Preorder traversal
path = new ArrayList<>();
res = new ArrayList<>();
preOrder(root);
System.out.println("\nOutput all root-to-node 7 paths, not including nodes with value 3");
System.out.println("\nOutput all paths from root node to node 7, paths do not include nodes with value 3");
for (List<TreeNode> path : res) {
List<Integer> vals = new ArrayList<>();
for (TreeNode node : path) {
en/codes/java/chapter_backtracking/preorder_traversal_iii_template.java
+8 -8
View File
@@ -10,7 +10,7 @@ import utils.*;
import java.util.*;
public class preorder_traversal_iii_template {
/* Determine if the current state is a solution */
/* Check if the current state is a solution */
static boolean isSolution(List<TreeNode> state) {
return !state.isEmpty() && state.get(state.size() - 1).val == 7;
}
@@ -20,7 +20,7 @@ public class preorder_traversal_iii_template {
res.add(new ArrayList<>(state));
}
/* Determine if the choice is legal under the current state */
/* Check if the choice is valid under the current state */
static boolean isValid(List<TreeNode> state, TreeNode choice) {
return choice != null && choice.val != 3;
}
@@ -35,22 +35,22 @@ public class preorder_traversal_iii_template {
state.remove(state.size() - 1);
}
/* Backtracking algorithm: Example three */
/* Backtracking algorithm: Example 3 */
static void backtrack(List<TreeNode> state, List<TreeNode> choices, List<List<TreeNode>> res) {
// Check if it's a solution
// Check if it is a solution
if (isSolution(state)) {
// Record solution
recordSolution(state, res);
}
// Traverse all choices
for (TreeNode choice : choices) {
// Pruning: check if the choice is legal
// Pruning: check if the choice is valid
if (isValid(state, choice)) {
// Attempt: make a choice, update the state
// Attempt: make choice, update state
makeChoice(state, choice);
// Proceed to the next round of selection
backtrack(state, Arrays.asList(choice.left, choice.right), res);
// Retract: undo the choice, restore to the previous state
// Backtrack: undo choice, restore to previous state
undoChoice(state, choice);
}
}
@@ -65,7 +65,7 @@ public class preorder_traversal_iii_template {
List<List<TreeNode>> res = new ArrayList<>();
backtrack(new ArrayList<>(), Arrays.asList(root), res);
System.out.println("\nOutput all root-to-node 7 paths, requiring paths not to include nodes with value 3");
System.out.println("\nOutput all paths from root node to node 7, requiring paths do not include nodes with value 3");
for (List<TreeNode> path : res) {
List<Integer> vals = new ArrayList<>();
for (TreeNode node : path) {
en/codes/java/chapter_backtracking/subset_sum_i.java
+7 -7
View File
@@ -9,7 +9,7 @@ package chapter_backtracking;
import java.util.*;
public class subset_sum_i {
/* Backtracking algorithm: Subset Sum I */
/* Backtracking algorithm: Subset sum I */
static void backtrack(List<Integer> state, int target, int[] choices, int start, List<List<Integer>> res) {
// When the subset sum equals target, record the solution
if (target == 0) {
@@ -17,23 +17,23 @@ public class subset_sum_i {
return;
}
// Traverse all choices
// Pruning two: start traversing from start to avoid generating duplicate subsets
// Pruning 2: start traversing from start to avoid generating duplicate subsets
for (int i = start; i < choices.length; i++) {
// Pruning one: if the subset sum exceeds target, end the loop immediately
// Pruning 1: if the subset sum exceeds target, end the loop directly
// This is because the array is sorted, and later elements are larger, so the subset sum will definitely exceed target
if (target - choices[i] < 0) {
break;
}
// Attempt: make a choice, update target, start
// Attempt: make choice, update target, start
state.add(choices[i]);
// Proceed to the next round of selection
backtrack(state, target - choices[i], choices, i, res);
// Retract: undo the choice, restore to the previous state
// Backtrack: undo choice, restore to previous state
state.remove(state.size() - 1);
}
}
/* Solve Subset Sum I */
/* Solve subset sum I */
static List<List<Integer>> subsetSumI(int[] nums, int target) {
List<Integer> state = new ArrayList<>(); // State (subset)
Arrays.sort(nums); // Sort nums
@@ -50,6 +50,6 @@ public class subset_sum_i {
List<List<Integer>> res = subsetSumI(nums, target);
System.out.println("Input array nums = " + Arrays.toString(nums) + ", target = " + target);
System.out.println("All subsets summing to " + target + " res = " + res);
System.out.println("All subsets with sum equal to " + target + " are res = " + res);
}
}
en/codes/java/chapter_backtracking/subset_sum_i_naive.java
+7 -7
View File
@@ -9,7 +9,7 @@ package chapter_backtracking;
import java.util.*;
public class subset_sum_i_naive {
/* Backtracking algorithm: Subset Sum I */
/* Backtracking algorithm: Subset sum I */
static void backtrack(List<Integer> state, int target, int total, int[] choices, List<List<Integer>> res) {
// When the subset sum equals target, record the solution
if (total == target) {
@@ -18,20 +18,20 @@ public class subset_sum_i_naive {
}
// Traverse all choices
for (int i = 0; i < choices.length; i++) {
// Pruning: if the subset sum exceeds target, skip that choice
// Pruning: if the subset sum exceeds target, skip this choice
if (total + choices[i] > target) {
continue;
}
// Attempt: make a choice, update elements and total
// Attempt: make choice, update element sum total
state.add(choices[i]);
// Proceed to the next round of selection
backtrack(state, target, total + choices[i], choices, res);
// Retract: undo the choice, restore to the previous state
// Backtrack: undo choice, restore to previous state
state.remove(state.size() - 1);
}
}
/* Solve Subset Sum I (including duplicate subsets) */
/* Solve subset sum I (including duplicate subsets) */
static List<List<Integer>> subsetSumINaive(int[] nums, int target) {
List<Integer> state = new ArrayList<>(); // State (subset)
int total = 0; // Subset sum
@@ -47,7 +47,7 @@ public class subset_sum_i_naive {
List<List<Integer>> res = subsetSumINaive(nums, target);
System.out.println("Input array nums = " + Arrays.toString(nums) + ", target = " + target);
System.out.println("All subsets summing to " + target + " res = " + res);
System.out.println("The result of this method includes duplicate sets");
System.out.println("All subsets with sum equal to " + target + " are res = " + res);
System.out.println("Please note that this method outputs results containing duplicate sets");
}
}
en/codes/java/chapter_backtracking/subset_sum_ii.java
+9 -9
View File
@@ -9,7 +9,7 @@ package chapter_backtracking;
import java.util.*;
public class subset_sum_ii {
/* Backtracking algorithm: Subset Sum II */
/* Backtracking algorithm: Subset sum II */
static void backtrack(List<Integer> state, int target, int[] choices, int start, List<List<Integer>> res) {
// When the subset sum equals target, record the solution
if (target == 0) {
@@ -17,28 +17,28 @@ public class subset_sum_ii {
return;
}
// Traverse all choices
// Pruning two: start traversing from start to avoid generating duplicate subsets
// Pruning three: start traversing from start to avoid repeatedly selecting the same element
// Pruning 2: start traversing from start to avoid generating duplicate subsets
// Pruning 3: start traversing from start to avoid repeatedly selecting the same element
for (int i = start; i < choices.length; i++) {
// Pruning one: if the subset sum exceeds target, end the loop immediately
// Pruning 1: if the subset sum exceeds target, end the loop directly
// This is because the array is sorted, and later elements are larger, so the subset sum will definitely exceed target
if (target - choices[i] < 0) {
break;
}
// Pruning four: if the element equals the left element, it indicates that the search branch is repeated, skip it
// Pruning 4: if this element equals the left element, it means this search branch is duplicate, skip it directly
if (i > start && choices[i] == choices[i - 1]) {
continue;
}
// Attempt: make a choice, update target, start
// Attempt: make choice, update target, start
state.add(choices[i]);
// Proceed to the next round of selection
backtrack(state, target - choices[i], choices, i + 1, res);
// Retract: undo the choice, restore to the previous state
// Backtrack: undo choice, restore to previous state
state.remove(state.size() - 1);
}
}
/* Solve Subset Sum II */
/* Solve subset sum II */
static List<List<Integer>> subsetSumII(int[] nums, int target) {
List<Integer> state = new ArrayList<>(); // State (subset)
Arrays.sort(nums); // Sort nums
@@ -55,6 +55,6 @@ public class subset_sum_ii {
List<List<Integer>> res = subsetSumII(nums, target);
System.out.println("Input array nums = " + Arrays.toString(nums) + ", target = " + target);
System.out.println("All subsets summing to " + target + " res = " + res);
System.out.println("All subsets with sum equal to " + target + " are res = " + res);
}
}