LeetCode 322. Coin Change

Description:

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:

Input: coins = [1, 2, 5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1

Solution

这个题目就是经典的 0-1背包 问题，整个解题过程就是填表过程。
dp[i] 表示凑 i 块钱最少需要的步骤。
所以状态转移方程自然就是：

//这里假设硬币的种类是 1 块钱，2 块钱，5块钱
dp[i] = min {dp[i - 1] + 1, dp[i - 2] + 1, dp[i - 5] + 1};

class Solution {
public:
    int CoinChange::coinChange(vector<int>& coins, int amount) {

    	vector<int> dp;
    	dp.push_back(0);
    	for (int i = 1; i < amount + 1; ++i) {
        	int small = INT_MAX - 1;
        	for (int coin : coins)
            	if (i - coin >= 0)
                	small = min(small, dp[i - coin]);
        	dp.push_back(++small);
    	}
    	return dp[amount] == INT_MAX ? -1 : dp[amount];
	}
};

上述代码中如果没有加 int samll = INT_MAX - 1； 会造成 ++small 溢出 int 型变量上限。