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-24 00:57:14 +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,42 @@
+/**
+ * File: binary_search_recur.dart
+ * Created Time: 2023-08-10
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+/* Binary search: problem f(i, j) */
+int dfs(List<int> nums, int target, int i, int j) {
+  // If the interval is empty, it means there is no target element, return -1
+  if (i > j) {
+    return -1;
+  }
+  // Calculate the midpoint index m
+  int m = (i + j) ~/ 2;
+  if (nums[m] < target) {
+    // Recursion subproblem f(m+1, j)
+    return dfs(nums, target, m + 1, j);
+  } else if (nums[m] > target) {
+    // Recursion subproblem f(i, m-1)
+    return dfs(nums, target, i, m - 1);
+  } else {
+    // Found the target element, return its index
+    return m;
+  }
+}
+
+/* Binary search */
+int binarySearch(List<int> nums, int target) {
+  int n = nums.length;
+  // Solve the problem f(0, n-1)
+  return dfs(nums, target, 0, n - 1);
+}
+
+/* Driver Code */
+void main() {
+  int target = 6;
+  List<int> nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
+
+  // Binary search (closed interval on both sides)
+  int index = binarySearch(nums, target);
+  print("Index of target element 6 = $index");
+}
@@ -0,0 +1,55 @@
+/**
+ * File: build_tree.dart
+ * Created Time: 2023-08-10
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+import '../utils/print_util.dart';
+import '../utils/tree_node.dart';
+
+/* Build binary tree: divide and conquer */
+TreeNode? dfs(
+  List<int> preorder,
+  Map<int, int> inorderMap,
+  int i,
+  int l,
+  int r,
+) {
+  // Terminate when the subtree interval is empty
+  if (r - l < 0) {
+    return null;
+  }
+  // Initialize the root node
+  TreeNode? root = TreeNode(preorder[i]);
+  // Query m to divide the left and right subtrees
+  int m = inorderMap[preorder[i]]!;
+  // Subproblem: build the left subtree
+  root.left = dfs(preorder, inorderMap, i + 1, l, m - 1);
+  // Subproblem: build the right subtree
+  root.right = dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
+  // Return the root node
+  return root;
+}
+
+/* Build binary tree */
+TreeNode? buildTree(List<int> preorder, List<int> inorder) {
+  // Initialize hash map, storing the mapping from inorder elements to indices
+  Map<int, int> inorderMap = {};
+  for (int i = 0; i < inorder.length; i++) {
+    inorderMap[inorder[i]] = i;
+  }
+  TreeNode? root = dfs(preorder, inorderMap, 0, 0, inorder.length - 1);
+  return root;
+}
+
+/* Driver Code */
+void main() {
+  List<int> preorder = [3, 9, 2, 1, 7];
+  List<int> inorder = [9, 3, 1, 2, 7];
+  print("Pre-order traversal = $preorder");
+  print("In-order traversal = $inorder");
+
+  TreeNode? root = buildTree(preorder, inorder);
+  print("The constructed binary tree is:");
+  printTree(root!);
+}
@@ -0,0 +1,54 @@
+/**
+ * File: hanota.dart
+ * Created Time: 2023-08-10
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+/* Move a disk */
+void move(List<int> src, List<int> tar) {
+  // Take out a disk from the top of src
+  int pan = src.removeLast();
+  // Place the disk on top of tar
+  tar.add(pan);
+}
+
+/* Solve the Tower of Hanoi problem f(i) */
+void dfs(int i, List<int> src, List<int> buf, List<int> tar) {
+  // If there is only one disk left in src, move it directly to tar
+  if (i == 1) {
+    move(src, tar);
+    return;
+  }
+  // Subproblem f(i-1): move the top i-1 disks from src to buf using tar
+  dfs(i - 1, src, tar, buf);
+  // Subproblem f(1): move the remaining disk from src to tar
+  move(src, tar);
+  // Subproblem f(i-1): move the top i-1 disks from buf to tar using src
+  dfs(i - 1, buf, src, tar);
+}
+
+/* Solve the Tower of Hanoi problem */
+void solveHanota(List<int> A, List<int> B, List<int> C) {
+  int n = A.length;
+  // Move the top n disks from A to C using B
+  dfs(n, A, B, C);
+}
+
+/* Driver Code */
+void main() {
+  // The tail of the list is the top of the rod
+  List<int> A = [5, 4, 3, 2, 1];
+  List<int> B = [];
+  List<int> C = [];
+  print("In initial state:");
+  print("A = $A");
+  print("B = $B");
+  print("C = $C");
+
+  solveHanota(A, B, C);
+
+  print("After disk movement is complete:");
+  print("A = $A");
+  print("B = $B");
+  print("C = $C");
+}