OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

adding doctests on coin_change.py and fixed some typos (#1337)

Browse Source 
* adding doctests on coin_change.py

* fixed some typos

* Update lib.py
This commit is contained in:
Iqrar Agalosi Nureyza 2019-12-18 14:35:03 +07:00 committed by Christian Clauss
parent f4779bc04a
commit 1af4c02ba6
1 changed files with 15 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
dynamic_programming/coin_change.py
View File

@ -8,6 +8,18 @@ https://www.hackerrank.com/challenges/coin-change/problem
def dp_count(S, m, n): def dp_count(S, m, n):
"""
>>> dp_count([1, 2, 3], 3, 4)
4
>>> dp_count([1, 2, 3], 3, 7)
8
>>> dp_count([2, 5, 3, 6], 4, 10)
5
>>> dp_count([10], 1, 99)
0
>>> dp_count([4, 5, 6], 3, 0)
1
"""
# table[i] represents the number of ways to get to amount i # table[i] represents the number of ways to get to amount i
table = [0] * (n + 1) table = [0] * (n + 1)
@ -24,7 +36,7 @@ def dp_count(S, m, n):
return table[n] return table[n]
if __name__ == "__main__": if __name__ == "__main__":
print(dp_count([1, 2, 3], 3, 4)) # answer 4 import doctest
print(dp_count([2, 5, 3, 6], 4, 10)) # answer 5
doctest.testmod()