mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-03 10:53:35 +08:00
* 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
64 lines
1.9 KiB
JavaScript
64 lines
1.9 KiB
JavaScript
/**
|
|
* File: unbounded_knapsack.js
|
|
* Created Time: 2023-08-23
|
|
* Author: Gaofer Chou (gaofer-chou@qq.com)
|
|
*/
|
|
|
|
/* Unbounded knapsack: Dynamic programming */
|
|
function unboundedKnapsackDP(wgt, val, cap) {
|
|
const n = wgt.length;
|
|
// Initialize dp table
|
|
const dp = Array.from({ length: n + 1 }, () =>
|
|
Array.from({ length: cap + 1 }, () => 0)
|
|
);
|
|
// State transition
|
|
for (let i = 1; i <= n; i++) {
|
|
for (let 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] = Math.max(
|
|
dp[i - 1][c],
|
|
dp[i][c - wgt[i - 1]] + val[i - 1]
|
|
);
|
|
}
|
|
}
|
|
}
|
|
return dp[n][cap];
|
|
}
|
|
|
|
/* Unbounded knapsack: Space-optimized dynamic programming */
|
|
function unboundedKnapsackDPComp(wgt, val, cap) {
|
|
const n = wgt.length;
|
|
// Initialize dp table
|
|
const dp = Array.from({ length: cap + 1 }, () => 0);
|
|
// State transition
|
|
for (let i = 1; i <= n; i++) {
|
|
for (let c = 1; c <= cap; c++) {
|
|
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] = Math.max(dp[c], dp[c - wgt[i - 1]] + val[i - 1]);
|
|
}
|
|
}
|
|
}
|
|
return dp[cap];
|
|
}
|
|
|
|
/* Driver Code */
|
|
const wgt = [1, 2, 3];
|
|
const val = [5, 11, 15];
|
|
const cap = 4;
|
|
|
|
// Dynamic programming
|
|
let res = unboundedKnapsackDP(wgt, val, cap);
|
|
console.log(`Maximum item value not exceeding knapsack capacity is ${res}`);
|
|
|
|
// Space-optimized dynamic programming
|
|
res = unboundedKnapsackDPComp(wgt, val, cap);
|
|
console.log(`Maximum item value not exceeding knapsack capacity is ${res}`);
|