322. Coin Change

You are given coins of different denominations and a total amount of money amount. 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
return 3 (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.

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

题意：

有一些硬币，都是无限量的，问能不能组成amount。

思路：

发现贪心还不行，有一些情况不满足，动态规划最保险。思路很简单，如果dp[i]=dp[i-coins[j]]+1,因为是求最小值，可能组成i可以由好几种硬币组成。同时注意，不要开数组，可能amount很大，用一个vector即可，初始值除了dp[0]=0,都设置成一个不可能为结果的值，最后如果还是那个值，就说明它不能由这些硬币组成。

代码：

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        sort(coins.begin(),coins.end());
        if(amount==0||coins.size()==0)
            return 0;
        vector<long>dp;
        dp.push_back(0);
        for(int i=1;i<=amount;i++)
            dp.push_back(INT_MAX);
        for(int i=1;i<=amount;i++)
        {
            for(int j=0;j<=coins.size()-1;j++)
            {
                if(i>=coins[j])
                {
                        dp[i]=min(dp[i],dp[i-coins[j]]+1);
                }
            }
        }
        if(dp[amount]==INT_MAX)
            return -1;
        return dp[amount];
    }
};