[leetcode] 518. Coin Change 2 @ python

原题

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

Note:

You can assume that

0 <= amount <= 5000
1 <= coin <= 5000
the number of coins is less than 500
the answer is guaranteed to fit into signed 32-bit integer

解法

动态规划. 构建一个从0到amount的列表dp, dp[i]表示构成数额i的组合方法. 初始化dp[0] = 1, 构成金额0共有1种方法. 动态转移方程:

dp[i] = sum(dp[i-coin]) for coin in coins

当i >= coin时, 构成i的方法数等于构成i-coin的方法数之和.

代码

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