-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathZeroOnePackage02.java
More file actions
39 lines (32 loc) · 957 Bytes
/
ZeroOnePackage02.java
File metadata and controls
39 lines (32 loc) · 957 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/**
* 《图解算法》中的原理实现
*/
public class ZeroOnePackage02{
public static void main(String[] args) {
// 物品数量
int N = 5;
// 背包承重
int W = 12;
// 物品重量
int w[] = {3, 5, 2, 6, 4};
// 物品价值
int v[] = {4, 4, 3, 5, 3};
int tab[][] = new int[N][W];
// i, j 指针
for (int i = 0; i < N; i++) {
for ( int j=0; j < W; j++) {
// 第一行要特殊处理
if (i == 0) {
tab[i][j] = w[i] > j + 1 ? 0 : tab[i][j-1];
} else {
if (w[i] > j + 1){
tab[i][j] = tab[i - 1][j];
}else{
tab[i][j] = Math.max(tab[i - 1][j], v[i] + tab[i - 1][j + 1 - w[i]]);
}
}
}
}
System.out.println(tab[N-1][W-1]);
}
}