You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
55 lines
1.3 KiB
55 lines
1.3 KiB
// File: knapsack_test.go
|
|
// Created Time: 2023-07-23
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
package chapter_dynamic_programming
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
func TestKnapsack(t *testing.T) {
|
|
wgt := []int{10, 20, 30, 40, 50}
|
|
val := []int{50, 120, 150, 210, 240}
|
|
c := 50
|
|
n := len(wgt)
|
|
|
|
// 暴力搜尋
|
|
res := knapsackDFS(wgt, val, n, c)
|
|
fmt.Printf("不超過背包容量的最大物品價值為 %d\n", res)
|
|
|
|
// 記憶化搜尋
|
|
mem := make([][]int, n+1)
|
|
for i := 0; i <= n; i++ {
|
|
mem[i] = make([]int, c+1)
|
|
for j := 0; j <= c; j++ {
|
|
mem[i][j] = -1
|
|
}
|
|
}
|
|
res = knapsackDFSMem(wgt, val, mem, n, c)
|
|
fmt.Printf("不超過背包容量的最大物品價值為 %d\n", res)
|
|
|
|
// 動態規劃
|
|
res = knapsackDP(wgt, val, c)
|
|
fmt.Printf("不超過背包容量的最大物品價值為 %d\n", res)
|
|
|
|
// 空間最佳化後的動態規劃
|
|
res = knapsackDPComp(wgt, val, c)
|
|
fmt.Printf("不超過背包容量的最大物品價值為 %d\n", res)
|
|
}
|
|
|
|
func TestUnboundedKnapsack(t *testing.T) {
|
|
wgt := []int{1, 2, 3}
|
|
val := []int{5, 11, 15}
|
|
c := 4
|
|
|
|
// 動態規劃
|
|
res := unboundedKnapsackDP(wgt, val, c)
|
|
fmt.Printf("不超過背包容量的最大物品價值為 %d\n", res)
|
|
|
|
// 空間最佳化後的動態規劃
|
|
res = unboundedKnapsackDPComp(wgt, val, c)
|
|
fmt.Printf("不超過背包容量的最大物品價值為 %d\n", res)
|
|
}
|