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

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

解题思路

采用动态规划的方法：

• 用dp[i]表示组成钱数为i的硬币的最小数量；
• 当最后一枚硬币编号为j时，组成钱数为i的硬币最小数量为dp[i-coins[j]]+1，因此遍历所有的硬币coins[j]，求dp[i-coins[j]]+1的最小值即为dp[i]；
• 最终求得dp[amount]即为此题的解；
• 时间复杂度为O(coins.size()*amount)。

代码如下：

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