leetcode-面试题08.11硬币

题目描述：

 

 

 

 方法：动态规划 完全背包问题

class Solution:
    def waysToChange(self, n: int) -> int:
        coins = [1,5,10,25]
        dp = [0] * (n+1)
        dp[0] = 1
        for coin in coins:
            for i in range(coin,n+1):
                dp[i] = (dp[i] + dp[i - coin])
        return dp[n] % 1000000007