LeetCode322 零钱兑换

给定不同面额的硬币 coins 和一个总金额 amount。编写一个函数来计算可以凑成总金额所需的最少的硬币个数。如果没有任何一种硬币组合能组成总金额，返回 -1。

示例 1:

输入: coins = [1, 2, 5], amount = 11
输出: 3
解释: 11 = 5 + 5 + 1
示例 2:

输入: coins = [2], amount = 3
输出: -1
说明:
你可以认为每种硬币的数量是无限的。

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        
        max_amount = amount + 1;
        memo = vector<int>(amount+1, -1);

        int res = search(coins, amount);
        return res == max_amount ? -1 : res;
    }

private:
    int max_amount;
    vector<int> memo;

    int search(vector<int>& coins, int amount){

        if(amount == 0)
            return 0;
        
        if(memo[amount] != -1)
            return memo[amount];
        
        int ret = max_amount;
        for(int coin : coins)
            if(amount - coin >= 0)
                ret = min(ret, 1+search(coins, amount - coin));
        
        memo[amount] = ret;

        return memo[amount];
    }
};


class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        
        vector<int> dp(amount+1, amount+1);
        dp[0] = 0;

        for(int coin : coins)
            for(int j = coin; j <= amount; j++)
                dp[j] = min(dp[j], 1+dp[j-coin]);
        return dp[amount] == amount+1 ? -1 : dp[amount];
    }
};