leetcode 322. Coin Change

原创 2016年06月02日 01:03:32

题目描述:
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.

很简单的动态规划,其中dp[i]表示和为i所需要的最少的硬币数,
ac代码:

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

另附上leetcode上的题解,上面有各种解法的比较和分析(暴力解法,自顶向下的dp和自底向上的dp)

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Leetcode 322. Coin Change (Medium) (cpp)

Leetcode 322. Coin Change (Medium) (cpp)
  • Niko_Ke
  • Niko_Ke
  • 2016年08月26日 16:17
  • 311

leetcode 322 Coin Change

#include "stdafx.h" #include #include #include using namespace std; class Solution { public: in...

leetcode 322. Coin Change 解题思路 C语言

You are given coins of different denominations and a total amount of money amount. Write a function ...

LeetCode解题报告 322. Coin Change [medium]

题目描述 You are given coins of different denominations and a total amount of money amount. Write a...

LeetCode322. Coin Change

You are given coins of different denominations and a total amount of money amount. Write a function ...

Leetcode-322.Coin Change

题目: You are given coins of different denominations and a total amount of money amount. Write a funct...

(LeetCode 322) Coin Change

Q: You are given coins of different denominations and a total amount of money amount. Write a funct...

322. Coin Change

代码如下: // CPP class Solution { public: int coinChange(vector& coins, int amount) { if (a...

动态规划 139 Word Break + 322 Coin Change

动态规划总结322. Coin ChangeYou are given coins of different denominations and a total amount of money amo...

541. Reverse String II\322. Coin Change

Reverse String II541. Reverse String IIGiven a string and an integer k, you need to reverse the firs...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode 322. Coin Change
举报原因:
原因补充:

(最多只允许输入30个字)