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-13 15:56:05 +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,60 @@
+/*
+ * File: unbounded_knapsack.rs
+ * Created Time: 2023-07-09
+ * Author: codingonion (coderonion@gmail.com)
+ */
+
+/* Unbounded knapsack: Dynamic programming */
+fn unbounded_knapsack_dp(wgt: &[i32], val: &[i32], cap: usize) -> i32 {
+    let n = wgt.len();
+    // Initialize dp table
+    let mut dp = vec![vec![0; cap + 1]; n + 1];
+    // State transition
+    for i in 1..=n {
+        for c in 1..=cap {
+            if wgt[i - 1] > c as i32 {
+                // 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] = std::cmp::max(dp[i - 1][c], dp[i][c - wgt[i - 1] as usize] + val[i - 1]);
+            }
+        }
+    }
+    return dp[n][cap];
+}
+
+/* Unbounded knapsack: Space-optimized dynamic programming */
+fn unbounded_knapsack_dp_comp(wgt: &[i32], val: &[i32], cap: usize) -> i32 {
+    let n = wgt.len();
+    // Initialize dp table
+    let mut dp = vec![0; cap + 1];
+    // State transition
+    for i in 1..=n {
+        for c in 1..=cap {
+            if wgt[i - 1] > c as i32 {
+                // 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] = std::cmp::max(dp[c], dp[c - wgt[i - 1] as usize] + val[i - 1]);
+            }
+        }
+    }
+    dp[cap]
+}
+
+/* Driver Code */
+pub fn main() {
+    let wgt = [1, 2, 3];
+    let val = [5, 11, 15];
+    let cap: usize = 4;
+
+    // Dynamic programming
+    let res = unbounded_knapsack_dp(&wgt, &val, cap);
+    println!("Maximum item value not exceeding knapsack capacity is {res}");
+
+    // Space-optimized dynamic programming
+    let res = unbounded_knapsack_dp_comp(&wgt, &val, cap);
+    println!("Maximum item value not exceeding knapsack capacity is {res}");
+}