322. Coin Change
来源:互联网 发布:sqlserver怎么读 编辑:程序博客网 时间:2024/06/05 13:53
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 coinChange(int[] coins, int amount) { int[] f = new int[amount + 1]; int n = coins.length; f[0] = 0; int i, j; for (i = 1; i <= amount; ++i) { f[i] = -1; for (j = 0; j < n; ++j) { if (i >= coins[j] && f[i - coins[j]] != -1) { if (f[i] == -1 || f[i - coins[j]] + 1 < f[i]) { f[i] = f[i - coins[j]] + 1; } } } } return f[amount]; }}
阅读全文
0 0
- [leetcode] 322. Coin Change
- leetcode 322. Coin Change
- Leetcode 322. Coin Change
- Leetcode 322. Coin Change
- 322. Coin Change
- 322. Coin Change LeetCode
- 322. Coin Change
- 322. Coin Change
- LeetCode *** 322. Coin Change
- 322. Coin Change
- LeetCode 322. Coin Change
- 322. Coin Change
- leetcode 322. Coin Change
- 322. Coin Change
- LeetCode-322.Coin Change
- Leetcode 322. Coin Change
- 322. Coin Change
- 322. Coin Change
- Java集合类解析
- FastDFS 图片上传功能实现
- [UE4]编译时的各个平台定义宏
- 调整数组顺序使奇数位于偶数前面(剑指Offer 第 13 题)
- c++ 调用Python接口小问题
- 322. Coin Change
- zookeeper技术原理(转)
- 深度学习Loss function之Softmax中的矩阵求导
- [UE4]蓝图调用c++
- java 基础--正则表达式
- linux命令学习-之echo
- 深度学习进阶(七)--复习(一)
- 为zabbix分布式监控应用配置TiDB
- java基础 接口