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.
大意：
给你n种钱币，然后给你一个总数amount，这些钱币可以用无数次，问你用这些钱币组成这个amount，最少的数量是多少？如果不能组成返回-1.

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

解答：
coin change这种题很常见，一般都是递推，和动态规划的题目。经典的问题是给你一堆钱币问你组成一个数能有多少种组成方法，现在问最少的情况。
考虑转移方程dp[i]表示组成i所用的最少钱币数是多少，则dp[i]=min(dp[i-coins[j]]+1,dp[i])为转移方程。
记得初始化的时候要设置一个比较大的值。