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

518. 零钱兑换 II

class Solution {
public:
    int change(int amount, vector<int>& coins) {
        vector<int> 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:
    def combinationSum4(self, nums, target):
        
        @cache
        def dfs(target):
            if target < 0:
                return 0
            if target == 0:
                return 1
            res = 0
            for num in nums:
                res += dfs(target - num)
            return res
        return dfs(target)