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-23 18:11:45 +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_backtracking/subset_sum_ii.js
+++ b/en/codes/javascript/chapter_backtracking/subset_sum_ii.js
@@ -0,0 +1,51 @@
+/**
+ * File: subset_sum_ii.js
+ * Created Time: 2023-07-30
+ * Author: yuan0221 (yl1452491917@gmail.com)
+ */
+
+/* Backtracking algorithm: Subset sum II */
+function backtrack(state, target, choices, start, res) {
+    // When the subset sum equals target, record the solution
+    if (target === 0) {
+        res.push([...state]);
+        return;
+    }
+    // Traverse all choices
+    // 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 (let i = start; i < choices.length; i++) {
+        // 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 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 choice, update target, start
+        state.push(choices[i]);
+        // Proceed to the next round of selection
+        backtrack(state, target - choices[i], choices, i + 1, res);
+        // Backtrack: undo choice, restore to previous state
+        state.pop();
+    }
+}
+
+/* Solve subset sum II */
+function subsetSumII(nums, target) {
+    const state = []; // State (subset)
+    nums.sort((a, b) => a - b); // Sort nums
+    const start = 0; // Start point for traversal
+    const res = []; // Result list (subset list)
+    backtrack(state, target, nums, start, res);
+    return res;
+}
+
+/* Driver Code */
+const nums = [4, 4, 5];
+const target = 9;
+const res = subsetSumII(nums, target);
+console.log(`Input array nums = ${JSON.stringify(nums)}, target = ${target}`);
+console.log(`All subsets with sum equal to ${target} res = ${JSON.stringify(res)}`);