题目
有n 个物品,它们有各自的重量和价值,现有给定容量的背包,如何让背包里装入的物品具有最大的价值总和?
思路
动态规划
- 初始状态
定义一个二维数组,存放状态,前i个物品放入大小为j的包中最大价值 - 状态转移
dp[i][j]
如果容量不够,价值等于前i-1同等容量j的价值
如果容量大于等于,价值等于前i-1容量j-weight[i]的价值+value[i];
代码
二维数组实现01背包
public class Main {
public static void main(String[] args) {
int[][] dp = new int[4][6];
int[] weight = {0,1,3,2};
int[] value = {0,1,2,3};
int bag = 5;
for(int i=1; i<weight.length; i++){
for(int j=1; j<=bag; j++){
if(j<weight[i]){
dp[i][j] = dp[i-1][j];
System.out.print(dp[i][j]);
}else{
dp[i][j] = Math.max(dp[i-1][j],dp[i-1][j-weight[i]]+value[i]);
System.out.print(dp[i][j]);
}
}
System.out.println();
}
}
}
一维数组实现01背包
int n = 2;
int[] w = {1, 2};
int[] v = {7, 2};
int[] dp = new int[n + 1];
for (int i = 0; i < w.length; i++) {
for (int j = n; j >= w[i]; j--) {
dp[j] = Math.max(dp[j], dp[j - w[i]] + v[i]);
}
}
System.out.println(dp[n]);
一维数组实现完全背包
int n = 2;
int[] w = {1, 2};
int[] v = {7, 2};
int[] dp = new int[n + 1];
for (int i = 0; i < w.length; i++) {
for (int j = w[i]; j <= n; j++) {
dp[j] = Math.max(dp[j], dp[j - w[i]] + v[i]);
}
}
System.out.println(dp[n]);