01背包问题,滚动数组
关键点1:dp数组:dp[j]表示背包容量为j时,能获得的最大价值
关键点2:遍历顺序:先遍历物品,再遍历背包容量
关键点3:背包要逆序遍历,不然会重复使用元素
public static void main(String[] args) {
int[] weight = {1, 3, 4};
int[] value = {15, 20, 30};
int bagWight = 4;
testWeightBagProblem(weight, value, bagWight);
}
public static void testWeightBagProblem(int[] weight, int[] value, int bagWeight){
int wLen = weight.length;
//定义dp数组:dp[j]表示背包容量为j时,能获得的最大价值
int[] dp = new int[bagWeight + 1];
//遍历顺序:先遍历物品,再遍历背包容量
for (int i = 0; i < wLen; i++){
for (int j = bagWeight; j >= weight[i]; j--){
dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i]);
}
}
//打印dp数组
for (int j = 0; j <= bagWeight; j++){
System.out.print(dp[j] + " ");
}
}
416. 分割等和子集
关键点1:数组为空时,false,数组总和%2 不等于0,false
关键点2:for循环,对数组求和,得到target=sum/2
关键点3:dp数组:dp[j]表示背包容量为j时,能获得的最大价值;
关键点4:dp数组初始化dp[0] = 0;因为dp[其它非0元素]要为一个较小值,后续才能在max中比较得到真实值,否则会覆盖真实值,所以dp[其它非0元素] = 0;所以,dp数组全部初始化为0;
关键点4:遍历顺序:先遍历物品,再遍历背包容量
关键点5:背包要逆序遍历,不然会重复使用元素
关键点6:递归公式,因为本题按题意可理解为重量和价值相等,所以weight[i] = nums[i];value[i] = nums[i]
关键点7:最终,返回 dp[target] == target
class Solution {
public boolean canPartition(int[] nums) {
if(nums == null || nums.length == 0) return false;
int n = nums.length;
int sum = 0;
for(int num : nums) {
sum += num;
}
//总和为奇数,不能平分
if(sum % 2 != 0) return false;
int target = sum / 2;
int[] dp = new int[target + 1];
for(int i = 0; i < n; i++){
for(int j = target; j >= nums[i]; j--){
dp[j] = Math.max(dp[j], dp[j-nums[i]] + nums[i]);
}
}
return dp[target] == target;
}
}