代码随想录算法训练营第42天｜01背包 滚动数组 416

01背包 dp[i][j]表示从[0,i]的物品任取放入容量为j的背包里的最大价值

两个for loop谁先谁后无所谓

vector<vector<int>> dp(weight.size(), vector<int>(bagweight+1, 0));

for (int j=weight[0]; j<=bagweight; j++) {
    dp[0][j]=value[0];
}

for (int i=0; i<weight.size(); i++) {
    for (int j=0; j<=bagweight; j++) {
        if (weight[i]>j) dp[i][j]=dp[i-1][j];
        else {
            dp[i][j]=max(dp[i-1][j],dp[i-1][j-weight[i]]+value[j]);
        }
    }
}

01背包 一维滚动数组

注意bagweight的遍历顺序必须是按下列这样来（j--) 不能从0开始 不然dp数组的index会overflow

vector<int> dp(bagweight+1, 0);

for (int i=0; i<weight.size(); i++) {
    for (int j=bagweight; j>=weight[i]; j--) {
        dp[j]=max(dp[j], dp[j-weight[i]]+value[i];
    }
}

416 先算出背包大小为total_sum的一半 重点是这道题按照物品价值等于物品重量来看 当dp[j]即价值=bagweight时return true

class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int total_sum=0;
        for (int i=0; i<nums.size(); i++) {
            total_sum+=nums[i];
        }
        if (total_sum%2==1) return false;
        
        int bagweight = total_sum/2;
        vector<int> dp(bagweight+1,0);
        for (int i=0; i<nums.size(); i++) {
            for (int j=bagweight; j>=nums[i]; j--) {
                dp[j]=max(dp[j], dp[j-nums[i]]+nums[i]);
                if (dp[j]==bagweight) return true;
            }
        }
        return false;
    }
};