链接 添加链接描述 标签 动态规划 思路 代码 class Solution(object): def waysToChange(self, n): """ :type n: int :rtype: int """ # coin = [1,5,10,25] coin = [1,2,5] n /= 5 dp = [1 for i in range(n+1)] # dp[0] = 1 for i in range(len(coin)): for j in range(coin[i],n+1): dp[j] += dp[j-coin[i]] return dp[-1]%1000000007