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-17 17:26:06 +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,63 @@
+/**
+ * File: unbounded_knapsack.swift
+ * Created Time: 2023-07-15
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* Unbounded knapsack: Dynamic programming */
+func unboundedKnapsackDP(wgt: [Int], val: [Int], cap: Int) -> Int {
+    let n = wgt.count
+    // Initialize dp table
+    var dp = Array(repeating: Array(repeating: 0, count: cap + 1), count: n + 1)
+    // State transition
+    for i in 1 ... n {
+        for c in 1 ... cap {
+            if wgt[i - 1] > c {
+                // If exceeds knapsack capacity, don't select item i
+                dp[i][c] = dp[i - 1][c]
+            } else {
+                // The larger value between not selecting and selecting item i
+                dp[i][c] = max(dp[i - 1][c], dp[i][c - wgt[i - 1]] + val[i - 1])
+            }
+        }
+    }
+    return dp[n][cap]
+}
+
+/* Unbounded knapsack: Space-optimized dynamic programming */
+func unboundedKnapsackDPComp(wgt: [Int], val: [Int], cap: Int) -> Int {
+    let n = wgt.count
+    // Initialize dp table
+    var dp = Array(repeating: 0, count: cap + 1)
+    // State transition
+    for i in 1 ... n {
+        for c in 1 ... cap {
+            if wgt[i - 1] > c {
+                // If exceeds knapsack capacity, don't select item i
+                dp[c] = dp[c]
+            } else {
+                // The larger value between not selecting and selecting item i
+                dp[c] = max(dp[c], dp[c - wgt[i - 1]] + val[i - 1])
+            }
+        }
+    }
+    return dp[cap]
+}
+
+@main
+enum UnboundedKnapsack {
+    /* Driver Code */
+    static func main() {
+        let wgt = [1, 2, 3]
+        let val = [5, 11, 15]
+        let cap = 4
+
+        // Dynamic programming
+        var res = unboundedKnapsackDP(wgt: wgt, val: val, cap: cap)
+        print("Maximum item value not exceeding knapsack capacity is \(res)")
+
+        // Space-optimized dynamic programming
+        res = unboundedKnapsackDPComp(wgt: wgt, val: val, cap: cap)
+        print("Maximum item value not exceeding knapsack capacity is \(res)")
+    }
+}