[LeetCode]322. Coin Change
来源:互联网 发布:gta男性捏脸数据 编辑:程序博客网 时间:2024/05/18 01:01
Description:
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.
————————————————————————————————————————————————————————————————
Solution:
题意:凑金钱面额。
思路:动态规划。这里的动态规划数组不是基于面值数量的数组,而是基于需要凑整的面额数组。
class Solution {public: int coinChange(vector<int>& coins, int amount) { vector<int> dp(amount + 1, amount + 1); dp[0] = 0; for (int i = 1; i <= amount; i++) { for (vector<int>::iterator j = coins.begin(); j != coins.end(); j++) { if (*j <= i) { // 如果无法组成amount,dp[amount] = min(amount + 1, amount + 1 + 1) = amount + 1 dp[i] = min(dp[i], dp[i - *j] + 1); } } } return dp[amount] > amount ? -1 : dp[amount]; }};
阅读全文
0 0
- [leetcode] 322. Coin Change
- leetcode 322. Coin Change
- Leetcode 322. Coin Change
- Leetcode 322. Coin Change
- 322. Coin Change LeetCode
- LeetCode *** 322. Coin Change
- LeetCode 322. Coin Change
- leetcode 322. Coin Change
- LeetCode-322.Coin Change
- Leetcode 322. Coin Change
- [Leetcode]322. Coin Change
- LeetCode 322. Coin Change
- [leetcode] 322. Coin Change
- Leetcode 322. Coin Change
- Leetcode-322.Coin Change
- 【LeetCode】322. Coin Change
- [LeetCode]322. Coin Change
- Leetcode 322. Coin Change
- 输出菱形
- loadrunner Web_类函数之web_switch_net_layer()
- AI challenger 场景分类 PyTorch 迁移学习 resnet18
- Eclipse接入第三方动态库.so方案
- hbase表数据的写入流程:(根据rowkey进行写入)
- [LeetCode]322. Coin Change
- 如何理解左操作数必须为左值
- 9月23日java总结
- 博弈论总结
- Linux suse jdk配置
- hbase表数据的读流程:(根据rowkey读)
- Python趣事-2-cgi
- 51单片机测频
- Struts 2 + Hibernate + Spring 开发环境的搭建与数据访问Dao的生成