leetcode-518. Coin Change 2零钱兑换2

题目

518. Coin Change 2
     Medium

1884

61

Add to List

Share
You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite number of each kind of coin.

Example 1:

Input: amount = 5, coins = [1, 2, 5]
Output: 4
Explanation: there are four ways to make up the amount:
5=5
5=2+2+1
5=2+1+1+1
5=1+1+1+1+1

Example 2:

Input: amount = 3, coins = [2]
Output: 0
Explanation: the amount of 3 cannot be made up just with coins of 2.

Example 3:

Input: amount = 10, coins = [10]
Output: 1

动态规划

这题与Coin Change凑零钱的区别在于凑零钱是问最少多少硬币可以凑好金额，而这题是问凑好金额可以有多少种方法。

首先动态规划问题定义状态
dp[i][j]：表示前i个硬币凑好 j 的金额有dp[i][j]种方法。

那么可以初始化dp[…][0]=1，dp[0][…]=0。凑出0元金额的方法总是只有一种，而用0元去凑其他金额总是0种方法。
最终答案就是 dp[len(coins)][amount]。

然后状态转移方程：
dp[i][j] = dp[i-1][j]+dp[i][j-coins[i-1]]

不选时，dp[i-1][j]就是不添加硬币。
选择时，dp[i][j-coins[i-1]]决定使用这个面值的硬币，那么就应该关注如何凑出金额 j - coins[i-1]。

class Solution(object):
    def change(self, amount, coins):
        """
        :type amount: int
        :type coins: List[int]
        :rtype: int
        """
        dp = [[0 for j in range(amount+1)] for i in range(len(coins)+1)]
        for i in range(len(coins)+1):
            dp[i][0] = 1
        for i in range(1,len(coins)+1):
            for j in range(1,amount+1):
                if j-coins[i-1]<0:
                    dp[i][j] = dp[i-1][j]
                else:
                    dp[i][j] = dp[i-1][j]+dp[i][j-coins[i-1]]
        return dp[len(coins)][amount]

状态压缩

class Solution(object):
    def change(self, amount, coins):
        """
        :type amount: int
        :type coins: List[int]
        :rtype: int
        """
        dp = [0 for j in range(amount+1)]
        dp[0] = 1
        for i in range(len(coins)):
            for j in range(1,amount+1):
                if j-coins[i-1]>=0:
                    dp[j] = dp[j]+dp[j-coins[i-1]]
        return dp[amount]