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[i]是要总额达到i时所需的最少的coin数量，初始值设为amount+1，因为这是不可能达到的值.  如果r[i]>amount,说明这些基本的coin不能组成i。

对于coins中的每一个基本coin，当i>=coin,都有 dp[i] =min{dp[i], dp[i-coin]}。

 int coinChange(vector<int>& coins, int amount) {
       vector<int> dp(amount+1,amount+1);
       //dp[i]是要总额达到i时所需的最少的coin数量，初始值设为amount+1，因为这是不可能达到的值
       //如果r[i]>amount,说明这些基本的coin不能组成i。
       dp[0]=0;
       for(int coin:coins)
       {
           for(int i=coin;i<=amount;i++)
           dp[i]=min(dp[i],dp[i-coin]+1);
       }
       return dp[amount]>amount?-1:dp[amount];
    }

复杂度：O(amount*n)，n为基本的coin数。