leetcode Coin Change
来源:互联网 发布:电脑无线mac地址修改器 编辑:程序博客网 时间:2024/05/16 06:15
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.
后续更新见原文:细语呢喃 > leetcode Coin Change
原文地址 http://www.hrwhisper.me/leetcode-coin-change/
更多的题解 http://www.hrwhisper.me/leetcode-algorithm-solution/
java
public class Solution { public int coinChange(int[] coins, int amount) { int dp[] = new int[amount + 1]; final int INF = 0x7ffffffe; for (int i = 1; i <= amount; i++) dp[i] = INF; for (int i = 0; i <= amount; i++) { for (int j = 0; j < coins.length; j++) { if (i + coins[j] <= amount) dp[i + coins[j]] = Math.min(dp[i + coins[j]], dp[i] + 1); } } return dp[amount] == INF ? -1 : dp[amount]; }}
1 0
- leetcode Coin Change
- Leetcode: Coin Change
- LeetCode Coin Change
- [leetcode] 322. Coin Change
- Leetcode: Coin Change
- [LeetCode 322] Coin Change
- leetcode--Coin Change
- [leetcode]Coin Change
- leetcode 322. Coin Change
- leetcode:Coin Change
- leetcode之Coin Change
- Leetcode 322. Coin Change
- Leetcode 322. Coin Change
- leetcode笔记:Coin Change
- leetcode 322 Coin Change
- 322. Coin Change LeetCode
- 【LeetCode-322】Coin Change
- leetcode之 coin change
- 【看书】int的范围
- webapi的form格式请求的问题
- IOS开发--数据持久化篇之文件存储(一)
- 数据结构实验之排序七:选课名单
- Git的简单使用
- leetcode Coin Change
- GCD 深入理解(二)
- mysql触发器的作用及语法
- 虚拟化三剑客专题-Hyper-V(下)
- Python项目管理
- xCode7 安装Alcatraz成功方法
- socket programming in kernel
- RedHat6.5安裝Gcc與Gcc-c++需要的包
- 虚拟化三剑客专题-Hyper-V(中)