动态规划（一）01背包问题

 1 import java.util.Arrays;
 2 
 3 public class Dp {
 4     public static void main(String[] args) {
 5 
 6         int[] weight = { 2, 2, 6, 5, 4 }; // 物品重量
 7         int[] value = { 6, 3, 5, 4, 6 }; // 物品价值
 8         int content = 10; // 背包容量
 9         int[][] ans = new int[11][11];// 数组记录
10 
11         for (int c = 1; c <= content; c++) {
12             for (int j = weight.length - 1; j >= 0; j--) {
13                 if (c - weight[j] < 0)
14                     ans[j][c] = ans[j + 1][c];
15                 else
16                     ans[j][c] = Math.max(ans[j + 1][c - weight[j]] + value[j],
17                             ans[j + 1][c]);
18             }
19         }
20         System.out.println("背包放入总价值最大为：" + ans[0][10]);
21         int[] save = { 0, 0, 0, 0, 0 }; // 是否放入
22         for (int i = 0; i <= weight.length - 1; i++) {
23             if (ans[i][content] - value[i] == ans[i + 1][content - weight[i]]) {
24                 save[i] = 1;
25                 content = content - weight[i];
26             }
27         }
28         System.out.println("放入哪些物品：" + Arrays.toString(save));
29 
30     }
31 }