mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
背包问题理论基础完全背包 Javascript
This commit is contained in:
@ -272,7 +272,38 @@ func main() {
|
||||
fmt.Println(test_CompletePack2(weight, price, 4))
|
||||
}
|
||||
```
|
||||
Javascript:
|
||||
```Javascript
|
||||
// 先遍历物品,再遍历背包容量
|
||||
function test_completePack1() {
|
||||
let weight = [1, 3, 5]
|
||||
let value = [15, 20, 30]
|
||||
let bagWeight = 4
|
||||
let dp = new Array(bagWeight + 1).fill(0)
|
||||
for(let i = 0; i <= weight.length; i++) {
|
||||
for(let j = weight[i]; j <= bagWeight; j++) {
|
||||
dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i])
|
||||
}
|
||||
}
|
||||
console.log(dp)
|
||||
}
|
||||
|
||||
// 先遍历背包容量,再遍历物品
|
||||
function test_completePack2() {
|
||||
let weight = [1, 3, 5]
|
||||
let value = [15, 20, 30]
|
||||
let bagWeight = 4
|
||||
let dp = new Array(bagWeight + 1).fill(0)
|
||||
for(let j = 0; j <= bagWeight; j++) {
|
||||
for(let i = 0; i < weight.length; i++) {
|
||||
if (j >= weight[i]) {
|
||||
dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i])
|
||||
}
|
||||
}
|
||||
}
|
||||
console.log(2, dp);
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
-----------------------
|
||||
|
Reference in New Issue
Block a user