[leetcode] 322. Coin Change

You are given coins of different denominations and a total amount of moneyamount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return-1.

Example 1:

coins =[1, 2, 5], amount =11
return3 (11 = 5 + 5 + 1)

Example 2:

coins =[2], amount =3
return-1.

Note:

You may assume that you have an infinite number of each kind of coin.

这道题是换零钱，求最少需要多少个硬币，题目难度为Medium。

这道题和第279题有些相似，比较典型的动态规划题目。要确定每个amount最少需要多少硬币，可以用amount依次减去每个硬币的面值，查看剩下总额最少需要多少硬币，取其中最小的加一即是当前amount需要的最少硬币数，这样就得到了递推公式，题目就迎刃而解了。具体代码：

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        if(amount < 0) return -1;
        vector<int> cnt(amount+1, amount+1);
        cnt[0] = 0;
        for(int i=1; i<=amount; ++i) {
            for(int j=0; j<coins.size(); ++j) {
                if(i>=coins[j]) {
                    cnt[i] = min(cnt[i], cnt[i-coins[j]] + 1);
                }
            }
        }
        return (cnt[amount]==amount+1) ? -1 : cnt[amount];
    }
};