leetcode No322. Coin Change

最新推荐文章于 2024-09-21 10:02:17 发布

Dufre.WC

最新推荐文章于 2024-09-21 10:02:17 发布

阅读量1.2k

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/u011391629/article/details/52526532

版权

leetcode 专栏收录该内容

189 篇文章 2 订阅

订阅专栏

Question:

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.

题目大意即，给定一个金额，和一些面值不等的硬币，每种硬币有无数个，能否凑出该金额，如果能返回最小硬币数，如果不能返回-1

Algorithm：

如果用贪心算法，即每次都取最大的，则错过了最优解，比如amount=24，｛1，6，10｝，则用贪心算法得出的结果是10，10，1，1，1，1，但是正确的结果是6，6，6，6。

用动态规划来求解这道题。过程如图，dp[i]=min{dp[i],dp[i-coin[j]]+1}

Accepted Code:

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        if(amount<0)return -1;
        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?-1:dp[amount];
    }
};