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-08 05:26: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,39 @@
+/**
+ * File: binary_search_recur.js
+ * Created Time: 2023-07-30
+ * Author: yuan0221 (yl1452491917@gmail.com)
+ */
+
+/* Binary search: problem f(i, j) */
+function dfs(nums, target, i, 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
+    const m = i + ((j - i) >> 1);
+    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 */
+function binarySearch(nums, target) {
+    const n = nums.length;
+    // Solve the problem f(0, n-1)
+    return dfs(nums, target, 0, n - 1);
+}
+
+/* Driver Code */
+const target = 6;
+const nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
+// Binary search (closed interval on both sides)
+const index = binarySearch(nums, target);
+console.log(`Index of target element 6 is ${index}`);
@@ -0,0 +1,44 @@
+/**
+ * File: build_tree.js
+ * Created Time: 2023-07-30
+ * Author: yuan0221 (yl1452491917@gmail.com)
+ */
+
+const { printTree } = require('../modules/PrintUtil');
+const { TreeNode } = require('../modules/TreeNode');
+
+/* Build binary tree: divide and conquer */
+function dfs(preorder, inorderMap, i, l, r) {
+    // Terminate when the subtree interval is empty
+    if (r - l < 0) return null;
+    // Initialize the root node
+    const root = new TreeNode(preorder[i]);
+    // Query m to divide the left and right subtrees
+    const m = inorderMap.get(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 */
+function buildTree(preorder, inorder) {
+    // Initialize hash map, storing the mapping from inorder elements to indices
+    let inorderMap = new Map();
+    for (let i = 0; i < inorder.length; i++) {
+        inorderMap.set(inorder[i], i);
+    }
+    const root = dfs(preorder, inorderMap, 0, 0, inorder.length - 1);
+    return root;
+}
+
+/* Driver Code */
+const preorder = [3, 9, 2, 1, 7];
+const inorder = [9, 3, 1, 2, 7];
+console.log('Preorder traversal = ' + JSON.stringify(preorder));
+console.log('Inorder traversal = ' + JSON.stringify(inorder));
+const root = buildTree(preorder, inorder);
+console.log('The constructed binary tree is:');
+printTree(root);
@@ -0,0 +1,52 @@
+/**
+ * File: hanota.js
+ * Created Time: 2023-07-30
+ * Author: yuan0221 (yl1452491917@gmail.com)
+ */
+
+/* Move a disk */
+function move(src, tar) {
+    // Take out a disk from the top of src
+    const pan = src.pop();
+    // Place the disk on top of tar
+    tar.push(pan);
+}
+
+/* Solve the Tower of Hanoi problem f(i) */
+function dfs(i, src, buf, 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 */
+function solveHanota(A, B, C) {
+    const n = A.length;
+    // Move the top n disks from A to C using B
+    dfs(n, A, B, C);
+}
+
+/* Driver Code */
+// The tail of the list is the top of the rod
+const A = [5, 4, 3, 2, 1];
+const B = [];
+const C = [];
+console.log('In initial state:');
+console.log(`A = ${JSON.stringify(A)}`);
+console.log(`B = ${JSON.stringify(B)}`);
+console.log(`C = ${JSON.stringify(C)}`);
+
+solveHanota(A, B, C);
+
+console.log('After disk movement is complete:');
+console.log(`A = ${JSON.stringify(A)}`);
+console.log(`B = ${JSON.stringify(B)}`);
+console.log(`C = ${JSON.stringify(C)}`);