We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. The Coin Change Problem
  5. Discussions

The Coin Change Problem

  • knyl2013
     + 1 comment

    Python DP based on the recursion:

    def getWays(n, c):
    dp = [[0 for col in range(len(c)+1)] for row in range(n+1)]

    # All empty coins can solve no amount except amount 0.
    for i in range(len(c)+1):
        dp[0][i] = 1
    
    for amount in range(1, n+1):
        for end in range(len(c)):  
            if amount-c[end] >= 0:
                dp[amount][end+1] = dp[amount-c[end]][end+1] + dp[amount][end]
            else:
                dp[amount][end+1] = dp[amount][end]

    return dp[n][len(c)]