LeetCode-322. Coin Change

最新推荐文章于 2020-12-26 21:10:43 发布

zy2317878

最新推荐文章于 2020-12-26 21:10:43 发布

阅读量218

点赞数

分类专栏： LeetCode 文章标签： LeetCode Dynamic Programming

本文链接：https://blog.csdn.net/zy2317878/article/details/80954168

版权

LeetCode 专栏收录该内容

254 篇文章 3 订阅

订阅专栏

Description

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.

Solution 1(C++)

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+1; i++){
            for(int j=0; j<coins.size(); j++){
                if(coins[j] <= i){
                    dp[i] = min(dp[i], dp[i-coins[j]]+1);
                }
            }
        }
        retrun dp[amount] > amount ? -1 : dp[amount];
    }
};