代码随想录算法训练营第43天|518. 零钱兑换 II、 377. 组合总和 Ⅳ

  518. 零钱兑换 II

class Solution {
public:
    int change(int amount, vector& coins) {
        //dp[j] += dp[j - coins[i]]
        vector dp(amount + 1, 0);
        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];
    }
};

377. 组合总和 Ⅳ

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