mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-06 13:49:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update coin_change.py (#706)

Browse Source 
Cleanup PEP-8 , additional comments , using coin_val, instead of range and index.
This commit is contained in:
pradyotd 2019-02-20 11:54:26 -05:00 committed by John Law
parent ad68eed73e
commit 98a149e41e
1 changed files with 9 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
dynamic_programming/coin_change.py
View File

@ -6,21 +6,26 @@ the given types of coins?
https://www.hackerrank.com/challenges/coin-change/problem https://www.hackerrank.com/challenges/coin-change/problem
""" """
from __future__ import print_function from __future__ import print_function
def dp_count(S, m, n): def dp_count(S, m, n):
# table[i] represents the number of ways to get to amount i
table = [0] * (n + 1) table = [0] * (n + 1)
# Base case (If given value is 0) # There is exactly 1 way to get to zero(You pick no coins).
table[0] = 1 table[0] = 1
# Pick all coins one by one and update table[] values # Pick all coins one by one and update table[] values
# after the index greater than or equal to the value of the # after the index greater than or equal to the value of the
# picked coin # picked coin
for i in range(0, m): for coin_val in S:
for j in range(S[i], n + 1): for j in range(coin_val, n + 1):
table[j] += table[j - S[i]] table[j] += table[j - coin_val]
return table[n] return table[n]
if __name__ == '__main__': if __name__ == '__main__':
print(dp_count([1, 2, 3], 3, 4)) # answer 4 print(dp_count([1, 2, 3], 3, 4)) # answer 4
print(dp_count([2, 5, 3, 6], 4, 10)) # answer 5 print(dp_count([2, 5, 3, 6], 4, 10)) # answer 5