LeetCode 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.

解题思路：使用动态规划解决这个问题。关键在于定义子问题。

假设有硬币coins= {A1,A2,...,An},我们设F(i)为amount为i时需要的最小硬币数目，那么

F(i) = 1 + min{ F(i - coins[ j ]) } (j = 1,2,....,n);

（一开始的时候尝试过将问题转化成01背包问题来解决，思路是先对coins递减排序，再用01背包问题的方法解决，但是最后弄得很复杂而且还没弄对，之后就放弃了这个想法转而用上述的方法）

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        int temp;
        vector<int> coin_nums(amount+1,INT_MAX);
        coin_nums[0]=0;
        for(int i = 1 ; i <= amount; ++i){
            temp = INT_MAX;
            for(int j=0; j != coins.size();++j){
                if(i-coins[j]>=0){ ///判断i是否大于等于coins[j],否则会出现负数
                    temp = coin_nums[i-coins[j]]<temp?coin_nums[i-coins[j]]:temp;
                }
            }
            if(temp != INT_MAX) coin_nums[i] = temp + 1;
        }
        if(coin_nums[amount] < INT_MAX) return coin_nums[amount];
        else return -1;
    }
};