mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix typo

Browse Source
This commit is contained in:
Erdenezul 2017-10-25 15:58:46 +08:00
parent 96536ad761
commit 53ce9b8068
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
dynamic_programming/coin_change.py
View File

@ -2,7 +2,7 @@
You have m types of coins available in infinite quantities You have m types of coins available in infinite quantities
where the value of each coins is given in the array S=[S0,... Sm-1] where the value of each coins is given in the array S=[S0,... Sm-1]
Can you determine number of ways of making change for n units using Can you determine number of ways of making change for n units using
the given types of coints? the given types of coins?
https://www.hackerrank.com/challenges/coin-change/problem https://www.hackerrank.com/challenges/coin-change/problem
""" """
def dp_count(S, m, n): def dp_count(S, m, n):