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-21 02:56:11 +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,137 @@
+/**
+ * File: knapsack.c
+ * Created Time: 2023-10-02
+ * Author: Zuoxun (845242523@qq.com)
+ */
+
+#include "../utils/common.h"
+
+/* Find maximum value */
+int myMax(int a, int b) {
+    return a > b ? a : b;
+}
+
+/* 0-1 knapsack: Brute-force search */
+int knapsackDFS(int wgt[], int val[], int i, int c) {
+    // If all items have been selected or knapsack has no remaining capacity, return value 0
+    if (i == 0 || c == 0) {
+        return 0;
+    }
+    // If exceeds knapsack capacity, can only choose not to put it in
+    if (wgt[i - 1] > c) {
+        return knapsackDFS(wgt, val, i - 1, c);
+    }
+    // Calculate the maximum value of not putting in and putting in item i
+    int no = knapsackDFS(wgt, val, i - 1, c);
+    int yes = knapsackDFS(wgt, val, i - 1, c - wgt[i - 1]) + val[i - 1];
+    // Return the larger value of the two options
+    return myMax(no, yes);
+}
+
+/* 0-1 knapsack: Memoization search */
+int knapsackDFSMem(int wgt[], int val[], int memCols, int **mem, int i, int c) {
+    // If all items have been selected or knapsack has no remaining capacity, return value 0
+    if (i == 0 || c == 0) {
+        return 0;
+    }
+    // If there's a record, return it directly
+    if (mem[i][c] != -1) {
+        return mem[i][c];
+    }
+    // If exceeds knapsack capacity, can only choose not to put it in
+    if (wgt[i - 1] > c) {
+        return knapsackDFSMem(wgt, val, memCols, mem, i - 1, c);
+    }
+    // Calculate the maximum value of not putting in and putting in item i
+    int no = knapsackDFSMem(wgt, val, memCols, mem, i - 1, c);
+    int yes = knapsackDFSMem(wgt, val, memCols, mem, i - 1, c - wgt[i - 1]) + val[i - 1];
+    // Record and return the larger value of the two options
+    mem[i][c] = myMax(no, yes);
+    return mem[i][c];
+}
+
+/* 0-1 knapsack: Dynamic programming */
+int knapsackDP(int wgt[], int val[], int cap, int wgtSize) {
+    int n = wgtSize;
+    // Initialize dp table
+    int **dp = malloc((n + 1) * sizeof(int *));
+    for (int i = 0; i <= n; i++) {
+        dp[i] = calloc(cap + 1, sizeof(int));
+    }
+    // State transition
+    for (int i = 1; i <= n; i++) {
+        for (int c = 1; c <= cap; c++) {
+            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] = myMax(dp[i - 1][c], dp[i - 1][c - wgt[i - 1]] + val[i - 1]);
+            }
+        }
+    }
+    int res = dp[n][cap];
+    // Free memory
+    for (int i = 0; i <= n; i++) {
+        free(dp[i]);
+    }
+    return res;
+}
+
+/* 0-1 knapsack: Space-optimized dynamic programming */
+int knapsackDPComp(int wgt[], int val[], int cap, int wgtSize) {
+    int n = wgtSize;
+    // Initialize dp table
+    int *dp = calloc(cap + 1, sizeof(int));
+    // State transition
+    for (int i = 1; i <= n; i++) {
+        // Traverse in reverse order
+        for (int c = cap; c >= 1; c--) {
+            if (wgt[i - 1] <= c) {
+                // The larger value between not selecting and selecting item i
+                dp[c] = myMax(dp[c], dp[c - wgt[i - 1]] + val[i - 1]);
+            }
+        }
+    }
+    int res = dp[cap];
+    // Free memory
+    free(dp);
+    return res;
+}
+
+/* Driver Code */
+int main() {
+    int wgt[] = {10, 20, 30, 40, 50};
+    int val[] = {50, 120, 150, 210, 240};
+    int cap = 50;
+    int n = sizeof(wgt) / sizeof(wgt[0]);
+    int wgtSize = n;
+
+    // Brute-force search
+    int res = knapsackDFS(wgt, val, n, cap);
+    printf("Maximum item value not exceeding knapsack capacity is %d\n", res);
+
+    // Memoization search
+    int **mem = malloc((n + 1) * sizeof(int *));
+    for (int i = 0; i <= n; i++) {
+        mem[i] = malloc((cap + 1) * sizeof(int));
+        memset(mem[i], -1, (cap + 1) * sizeof(int));
+    }
+    res = knapsackDFSMem(wgt, val, cap + 1, mem, n, cap);
+    printf("Maximum item value not exceeding knapsack capacity is %d\n", res);
+    // Free memory
+    for (int i = 0; i <= n; i++) {
+        free(mem[i]);
+    }
+    free(mem);
+
+    // Dynamic programming
+    res = knapsackDP(wgt, val, cap, wgtSize);
+    printf("Maximum item value not exceeding knapsack capacity is %d\n", res);
+
+    // Space-optimized dynamic programming
+    res = knapsackDPComp(wgt, val, cap, wgtSize);
+    printf("Maximum item value not exceeding knapsack capacity is %d\n", res);
+
+    return 0;
+}