最大背包问题的代码
网上看到的背包代码都有点复杂,给个最基础的额
```java
package dongtaiguihua;
public class MymaxBag {
static int n; // 描述物品个数
static int c; // 描述背包容量
static int[] value; // 描述物品价值
static int[] weight; // 描述物品重量
public static void main(String[] args) {
value = new int[]{6, 3,5,4,6};
weight = new int[]{2,2,6,5,4};
c = 10;
n = 5;
int[][] maxValue = new int[n][c];
for (int i = 0; i < n; i++) {
for (int j = 0; j < c; j++) {
maxValue[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < c; j++) {
if (i == 0) {
if (j+1 >= weight[0]) {
maxValue[0][j] = value[0];
}
} else {
if (j >= weight[i]) {
maxValue[i][j] = Math.max(maxValue[i - 1][j], value[i] + maxValue[i - 1][j - weight[i]]);
}else{
maxValue[i][j] = maxValue[i-1][j];
}
}
}
}
for (int io = 1; io < 11; io++) {
System.out.printf("%6d", io);
}
System.out.println();
System.out.println();
for (int iq = 0; iq < n; iq++) {
for (int j = 0; j < c; j++) {
System.out.printf("%6d", maxValue[iq][j]);
}
System.out.println();
}
}
}