public class Solution {
public static void main(String[] args) {
Solution solution = new Solution();
int[] weight = {1, 3, 4};
int[] value = {15, 20, 30};
int capacity = 4;
int res = knapsack(weight, value, capacity);
}
/**
* @param weight 每件物品的重量
* @param value 每件物品的价值
* @param capacity 背包的最大容量
* dp[i][j]
* i:编号0~i的物品
* j:放进容量为j的背包
* 不放物品:dp[i-1][j]
* OR
* 放物品:value[i]+dp[i-1][j-weight[j]]
*/
private static int knapsack(int[] weight, int[] value, int capacity) {
int[][] dp = new int[value.length][capacity + 1];
//背包初始化
for (int j = weight[0]; j < dp[0].length; j++) {
dp[0][j] = value[0];
}
for (int i = 1; i < dp.length; i++) {//遍历物品
for (int j = 1; j < dp[0].length; j++) {//遍历背包容量
if (j < weight[i]) {
dp[i][j] = dp[i - 1][j];
} else {
int a1 = dp[i - 1][j];//不放
int a2 = value[i] + dp[i - 1][j - weight[i]];//放
dp[i][j] = Math.max(a1, a2);
}
}
}
return dp[dp.length - 1][dp[0].length - 1];
}
}
扩展:
Q:什么是部分背包问题?
A:就是背包中的物品可以放半个,不一定要放一整个