完全背包求方案数

完全背包

// 先遍历物品，在遍历背包
void test_CompletePack() {
    vector<int> weight = {1, 3, 4};
    vector<int> value = {15, 20, 30};
    int bagWeight = 4;
    vector<int> dp(bagWeight + 1, 0);
    for(int i = 0; i < weight.size(); i++) { // 遍历物品
        for(int j = weight[i]; j <= bagWeight; j++) { // 遍历背包容量
            dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
        }
    }
    cout << dp[bagWeight] << endl;
}
int main() {
    test_CompletePack();
}

$时间复杂度O(n*m)、空间复杂度O(m);

// 先遍历背包，再遍历物品
void test_CompletePack() {
    vector<int> weight = {1, 3, 4};
    vector<int> value = {15, 20, 30};
    int bagWeight = 4;

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

    for(int j = 0; j <= bagWeight; j++) { // 遍历背包容量
        for(int i = 0; i < weight.size(); i++) { // 遍历物品
            if (j - weight[i] >= 0) dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
        }
    }
    cout << dp[bagWeight] << endl;
}
int main() {
    test_CompletePack();
}

$时间复杂度O(n*m)、空间复杂度O(m);

518. 零钱兑换 II

方法：完全背包(求方案数)

class Solution {
    #define maxn 5010
    int dp[maxn];
public:
    int change(int amount, vector<int>& coins) {
        dp[0] = 1;
        for (int i = 0; i < coins.size(); ++i) {
            for (int j = coins[i]; j <= amount; ++j) {
                dp[j] += dp[j-coins[i]];
            }
        }
        return dp[amount];
    }
};

$时间复杂度O(n*m)、空间复杂度O(m);

377. 组合总和 Ⅳ

方法：完全背包(求方案数)

class Solution {
    #define maxn 1010
    int dp[maxn];
public:
    int combinationSum4(vector<int>& nums, int t) {
        dp[0] = 1;
        for (int i = 0; i <= t; ++i) {
            for (int j = 0; j < nums.size(); ++j) {
                if (i - nums[j] >= 0 && dp[i] < INT_MAX - dp[i-nums[j]]) dp[i] += dp[i-nums[j]];
            }
        }
        return dp[t];
    }
};

$时间复杂度O(n*m)、空间复杂度O(m);