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-04-13 18:00:18 +08:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
--- a/en/codes/javascript/chapter_dynamic_programming/edit_distance.js
+++ b/en/codes/javascript/chapter_dynamic_programming/edit_distance.js
@@ -0,0 +1,135 @@
+/**
+ * File: edit_distance.js
+ * Created Time: 2023-08-23
+ * Author: Gaofer Chou (gaofer-chou@qq.com)
+ */
+
+/* Edit distance: Brute-force search */
+function editDistanceDFS(s, t, i, j) {
+    // If both s and t are empty, return 0
+    if (i === 0 && j === 0) return 0;
+
+    // If s is empty, return length of t
+    if (i === 0) return j;
+
+    // If t is empty, return length of s
+    if (j === 0) return i;
+
+    // If two characters are equal, skip both characters
+    if (s.charAt(i - 1) === t.charAt(j - 1))
+        return editDistanceDFS(s, t, i - 1, j - 1);
+
+    // Minimum edit steps = minimum edit steps of insert, delete, replace + 1
+    const insert = editDistanceDFS(s, t, i, j - 1);
+    const del = editDistanceDFS(s, t, i - 1, j);
+    const replace = editDistanceDFS(s, t, i - 1, j - 1);
+    // Return minimum edit steps
+    return Math.min(insert, del, replace) + 1;
+}
+
+/* Edit distance: Memoization search */
+function editDistanceDFSMem(s, t, mem, i, j) {
+    // If both s and t are empty, return 0
+    if (i === 0 && j === 0) return 0;
+
+    // If s is empty, return length of t
+    if (i === 0) return j;
+
+    // If t is empty, return length of s
+    if (j === 0) return i;
+
+    // If there's a record, return it directly
+    if (mem[i][j] !== -1) return mem[i][j];
+
+    // If two characters are equal, skip both characters
+    if (s.charAt(i - 1) === t.charAt(j - 1))
+        return editDistanceDFSMem(s, t, mem, i - 1, j - 1);
+
+    // Minimum edit steps = minimum edit steps of insert, delete, replace + 1
+    const insert = editDistanceDFSMem(s, t, mem, i, j - 1);
+    const del = editDistanceDFSMem(s, t, mem, i - 1, j);
+    const replace = editDistanceDFSMem(s, t, mem, i - 1, j - 1);
+    // Record and return minimum edit steps
+    mem[i][j] = Math.min(insert, del, replace) + 1;
+    return mem[i][j];
+}
+
+/* Edit distance: Dynamic programming */
+function editDistanceDP(s, t) {
+    const n = s.length,
+        m = t.length;
+    const dp = Array.from({ length: n + 1 }, () => new Array(m + 1).fill(0));
+    // State transition: first row and first column
+    for (let i = 1; i <= n; i++) {
+        dp[i][0] = i;
+    }
+    for (let j = 1; j <= m; j++) {
+        dp[0][j] = j;
+    }
+    // State transition: rest of the rows and columns
+    for (let i = 1; i <= n; i++) {
+        for (let j = 1; j <= m; j++) {
+            if (s.charAt(i - 1) === t.charAt(j - 1)) {
+                // If two characters are equal, skip both characters
+                dp[i][j] = dp[i - 1][j - 1];
+            } else {
+                // Minimum edit steps = minimum edit steps of insert, delete, replace + 1
+                dp[i][j] =
+                    Math.min(dp[i][j - 1], dp[i - 1][j], dp[i - 1][j - 1]) + 1;
+            }
+        }
+    }
+    return dp[n][m];
+}
+
+/* Edit distance: Space-optimized dynamic programming */
+function editDistanceDPComp(s, t) {
+    const n = s.length,
+        m = t.length;
+    const dp = new Array(m + 1).fill(0);
+    // State transition: first row
+    for (let j = 1; j <= m; j++) {
+        dp[j] = j;
+    }
+    // State transition: rest of the rows
+    for (let i = 1; i <= n; i++) {
+        // State transition: first column
+        let leftup = dp[0]; // Temporarily store dp[i-1, j-1]
+        dp[0] = i;
+        // State transition: rest of the columns
+        for (let j = 1; j <= m; j++) {
+            const temp = dp[j];
+            if (s.charAt(i - 1) === t.charAt(j - 1)) {
+                // If two characters are equal, skip both characters
+                dp[j] = leftup;
+            } else {
+                // Minimum edit steps = minimum edit steps of insert, delete, replace + 1
+                dp[j] = Math.min(dp[j - 1], dp[j], leftup) + 1;
+            }
+            leftup = temp; // Update for next round's dp[i-1, j-1]
+        }
+    }
+    return dp[m];
+}
+
+const s = 'bag';
+const t = 'pack';
+const n = s.length,
+    m = t.length;
+
+// Brute-force search
+let res = editDistanceDFS(s, t, n, m);
+console.log(`Changing ${s} to ${t} requires minimum ${res} edits`);
+
+// Memoization search
+const mem = Array.from(new Array(n + 1), () => new Array(m + 1).fill(-1));
+res = editDistanceDFSMem(s, t, mem, n, m);
+console.log(`Changing ${s} to ${t} requires minimum ${res} edits`);
+
+// Dynamic programming
+res = editDistanceDP(s, t);
+console.log(`Changing ${s} to ${t} requires minimum ${res} edits`);
+
+// Space-optimized dynamic programming
+res = editDistanceDPComp(s, t);
+console.log(`Changing ${s} to ${t} requires minimum ${res} edits`);