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

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

(LeetCode 322) Coin Change

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

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

leetcode 322. 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

322. Coin Change Total Accepted: 25730 Total Submissions: 102022 Difficulty: Medium You are g...

322. Coin Change

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

Leetcode 322. Coin Change (Medium) (cpp)

Leetcode 322. Coin Change (Medium) (cpp)

322. Coin Change

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

322. Coin Change

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

322. Coin Change

题意: You are given coins of different denominations and a total amount of money amount. Write a funct...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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