[leetcode]322. Coin Change
来源:互联网 发布:淘宝上的宠物狗 编辑:程序博客网 时间:2024/06/04 20:15
题目链接:https://leetcode.com/problems/coin-change/#/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
.
class Solution{public: int coinChange(vector<int>& coins,int amount) { int Max=amount+1; vector<int> res(amount+1,Max); res[0]=0; for(int i=1;i<=amount;i++) { for(int j=0;j<coins.size();j++) { if(coins[j]<=i) res[i]=min(res[i],res[i-coins[j]]+1); } } return res[amount]>amount?-1:res[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
- 洛谷P1908 逆序对(树状数组)
- 八款开源 Android 游戏引擎
- Ubuntu下sqlite3和mysql数据库的安装
- hadoop 伪分布模式的搭建
- 查看OpenCV中Mat数据的几种方法
- [leetcode]322. Coin Change
- C++实现一个堆(模板)
- AS下利用NDK输出Hello World!
- Spring定时任务( Spring-Task)用法
- Ubuntu中升级gcc,g++版本
- C++-malloc和new的区别与联系
- css3开发:rem与px的换算
- @程序猿,你有一份小程序开发福利未领取!
- ubuntu下Redis无法通过外网访问