【LeetCode】322. Coin Change

最新推荐文章于 2022-02-13 23:11:44 发布

Juxin_Lin

最新推荐文章于 2022-02-13 23:11:44 发布

阅读量277

点赞数

分类专栏： leetcode DP 文章标签： leetcode DP

本文链接：https://blog.csdn.net/Juxin_Lin/article/details/53000245

版权

leetcode 同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

10 篇文章 0 订阅

订阅专栏

Difficulty: Medium

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.

f[i]表示组成和为i的最少数;

f[0]=0;

状态转移方程f[i]=min{ f[ i-nums[j] ] }+1;

算法时间复杂度为O(amount * coins.size() )

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
	int i,j,n;
	n=coins.size();
	if(amount == 0)	return 0;
	vector<int> f(amount+1,-1);
	f[0]=0;
	for(i=1;i<=amount;i++)
	{
		for(j=0;j<n;j++)
		{
			if(coins[j] <= i && f[i-coins[j]] != -1 && (f[i-coins[j]] < f[i] || f[i] == -1))
				f[i] = f[i-coins[j]] + 1;
		}
	}
	
	return f[amount];
}
};