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.

思路：还是典型的DP问题，递推式是d[i] = min(d[i], d[i-c[i]]+1)，具体方法是构建一个比amount大一的数组，然后不断遍历就好了，下面是我的代码，但是我的思路是d[i+c[i]]=min(d[i]+1,d[i+c[i]]） ，这里有几个需要注意的地方，首先是如果coins中有超过32位的数，这个数加上i可能会超界，所以要加上一些限制条件，而且要不去遍历那些res[i]!=-1的结果，具体见代码：

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

当然，索引加法的要考虑的限制条件比较多，所以利用索引减法，也就是按照递推式d[i]=min(d[i],d[i-c[i]]+1) 的解法要简单一些，而且不用考虑res[i]==-1的情况：

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