题目:
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
.
解答:
很典型的Dp,直接代码即可
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> record;
record.push_back(0);
sort(coins.begin(),coins.end());
for(int i = 1; i <= amount; ++i)
{
int tmp = 1 << 30;
for(int j = 0;j < coins.size() && coins[j] <= i;++j)
{
if(1 + record[i - coins[j]] < tmp)
tmp = 1 + record[i - coins[j]];
}
record.push_back(tmp);
}
return record[amount] == 1 << 30 ? -1 : record[amount];
}
};