硬币问题(经典dp)

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.

状态：d(i)定义为组合i 所用的最少的硬币数。

状态转移方程：d(i)=min{d(j)+1} i>=j+v

(注意：memset只能初始化-1和0)

AC源码：

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