首页 > 其他 > 详细

leetcode@ [322] Coin Change (Dynamic Programming)

时间:2016-01-04 16:56:25      阅读:131      评论:0      收藏:0      [点我收藏+]

https://leetcode.com/problems/coin-change/

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.

 

技术分享
class Solution {
public:
    int dfs(int amount, vector<int>& coins, vector<int>& dp) {
        if(amount == 0) return 0;
        if(amount < 0) return INT_MAX;
        if(dp[amount]) return dp[amount];
        
        int minChange = INT_MAX;
        for(int i=0;i<coins.size();++i) {
            int eachChange = dfs(amount-coins[i], coins, dp);
            if(eachChange == INT_MAX) minChange = min(minChange, INT_MAX);
            else minChange = min(minChange, eachChange + 1);
        }
        dp[amount] = minChange;
        
        return dp[amount];
    }
    int coinChange(vector<int>& coins, int amount) {
        int n = coins.size();
        
        if(n == 0 && amount > 0) return -1;
        if(n == 0 && amount == 0) return 0;
        
        vector<int> dp(amount+1, 0);
        dp[amount] = dfs(amount, coins, dp);
        
        if(dp[amount] == INT_MAX) return -1;
        else return dp[amount];
    }
};
View Code

 

leetcode@ [322] Coin Change (Dynamic Programming)

原文:http://www.cnblogs.com/fu11211129/p/5099478.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!