本文对LeetCode的第322题-Coins Change题目进行分析,题目链接。
题目:
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.
题目大意:
给几种面值的零钱和一个总钱数,返回最少需要多少张(个)零钱恰好换取总钱数,无法换取返回-1。
解题:
先说结论:动态规划的方法,时间复杂度是O(mn),m和n分别代表零钱种类数量和总钱数,空间复杂度是O(n)。
开辟一个(n+1)大小的数组dp,初始值为无穷大(其实大于n即可)。令dp[0]=0,即当总钱数为0的时候,0张零钱就能兑换。
利用动态规划思想,dp[i] = min(dp[i], dp[i-c]+1),总钱数为i时,应该找所有面值 <= i的c,在dp[i]和dp[i-c]+1中取更小的。
考虑题目中的例子:
coins为1,2,5。总钱数为11。
dp数组初始值为:
零钱种类有1,2,5,所以dp[1] = min(dp[1], dp[1-1]+1),得1。
0 13 13 13 13 13 13 13 13 13 13 13 此时dp数组为:
零钱1和2都能进行兑换,dp[2] = min(dp[2], dp[2-1]+1),得2,dp[2] = min(dp[2], dp[2-1]+1),得1。
0 1 13 13 13 13 13 13 13 13 13 13 此时dp数组为:
......
0 1 1 13 13 13 13 13 13 13 13 13 直到循环结束。
源码:
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
int dp[amount+1];
for(int i = 0; i<=amount; i++)
dp[i] = amount+1;
dp[0] = 0;
for(int i = 1; i <= amount; i++){
for(int c:coins){
if(c <= i){
dp[i] = min(dp[i], dp[i-c]+1);
}
}
}
if(dp[amount] > amount)
return -1;
return dp[amount];
}
};