Interview questions 08.11. Coins (dynamic programming)

link

Add link description

label

Dynamic programming

Ideas

Code

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