Leetcode 322. Coin Change 零钱兑换

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:

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

Example 2:

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

解答

这道题用贪心算不出来，要用动态规划做。

DP公式如下

$dp[i]=min(dp[i],dp[i-c]+1);$

其中dp[i] 是组成 i 硬币面值需要多少硬币，dp[i - c] + 1 是加上面值为c的硬币需要的硬币数量。

代码

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        vector<int > dp(amount + 1, INT_MAX);
        dp[0] = 0;
        for (auto & c : coins) {
             for (int i = 1; i <= amount; i ++){
                if (i >= c && dp[i - c] != INT_MAX) {
                    dp[i] = min(dp[i], dp[i - c] + 1);
                }
            }
        }

        return dp[amount] == INT_MAX ? -1 : dp[amount];
    }
};