mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 05:39:30 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
47 lines
1.1 KiB
Python
47 lines
1.1 KiB
Python
"""
|
|
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]
|
|
Can you determine number of ways of making change for n units using
|
|
the given types of coins?
|
|
https://www.hackerrank.com/challenges/coin-change/problem
|
|
"""
|
|
|
|
|
|
def dp_count(s, n):
|
|
"""
|
|
>>> dp_count([1, 2, 3], 4)
|
|
4
|
|
>>> dp_count([1, 2, 3], 7)
|
|
8
|
|
>>> dp_count([2, 5, 3, 6], 10)
|
|
5
|
|
>>> dp_count([10], 99)
|
|
0
|
|
>>> dp_count([4, 5, 6], 0)
|
|
1
|
|
>>> dp_count([1, 2, 3], -5)
|
|
0
|
|
"""
|
|
if n < 0:
|
|
return 0
|
|
# table[i] represents the number of ways to get to amount i
|
|
table = [0] * (n + 1)
|
|
|
|
# There is exactly 1 way to get to zero(You pick no coins).
|
|
table[0] = 1
|
|
|
|
# Pick all coins one by one and update table[] values
|
|
# after the index greater than or equal to the value of the
|
|
# picked coin
|
|
for coin_val in s:
|
|
for j in range(coin_val, n + 1):
|
|
table[j] += table[j - coin_val]
|
|
|
|
return table[n]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|