算法分析与设计丨第十三周丨LeetCode（17）——Coin Change（Medium）

最新推荐文章于 2023-08-18 11:55:50 发布

SYSUxx

最新推荐文章于 2023-08-18 11:55:50 发布

阅读量196

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/xxhi008/article/details/78675238

版权

LeetCode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

题目描述：

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.

题目解析：

类似背包问题。

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