322. Coin Change

题目：

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

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

You may assume that you have an infinite number of each kind of coin.

Example 1:

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

Example 2:

Input: coins = [2], amount = 3
Output: -1

Example 3:

Input: coins = [1], amount = 0
Output: 0

Constraints:

• 1 <= coins.length <= 12
• 1 <= coins[i] <= 2^31 - 1
• 0 <= amount <= 10^4

思路：

完全背包问题，硬币可以无限拿，求不同组合的个数。dp[j]代表总和为j的钱最少拿几个硬币。因为题目求最少，初始化为0，但是dp[0]应为0，理解为0块钱当然不存在。dp公式为dp[j] = max(dp[j], dp[j - nums[i]] + 1)，比如我已知和为3块的时候最少是x个硬币，当前物品是硬币2时，那么计算dp[5]的时候我们可以从dp[3]获得，即x个，再加上1，即当前这个2元硬币即可。 遍历顺序为外层是物品种类，内层为背包种类，之后遍历的时候如果dp[j - coins[i]]是INT_MAX的话则跳过。

代码：

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        vector<int> f(amount + 1, INT_MAX);
        f[0] = 0;
        for (int i = 0; i < coins.size(); i++) {
            for (int j = coins[i]; j < amount + 1; j++) {
                if (f[j - coins[i]] == INT_MAX) continue;
                f[j] = min(f[j], f[j - coins[i]] + 1);
            }
        }
        return f.back() == INT_MAX ? -1 : f.back();
    }
};