LeetCode面试题 08.11. 硬币（完全背包）

LeetCode面试题 08.11. 硬币

完全背包模板题

class Solution:
    def waysToChange(self, n: int) -> int:

        m, p, mod = 4, [1, 5, 10, 25], 1000000007
        dp = [0 for i in range(n + 1)]
        for i in range(m): dp[0] = 1

        for i in range(m):
            for j in range(p[i], n + 1):
                dp[j] = (dp[j - p[i]] + dp[j]) % mod 
        
        return dp[n]