Commit 98a149e

pradyotdpoyea

authored and

committed

Update coin_change.py (TheAlgorithms#706)

Cleanup PEP-8 , additional comments , using coin_val, instead of range and index.

1 parent ad68eed commit 98a149eCopy full SHA for 98a149e

File tree

-4

lines changed

-4

lines changed

Lines changed: 9 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,21 +6,26 @@`
`6`	`6`	`https://www.hackerrank.com/challenges/coin-change/problem`
`7`	`7`	`"""`
`8`	`8`	`from __future__ import print_function`
	`9`	`+`
	`10`	`+`
`9`	`11`	`def dp_count(S, m, n):`
	`12`	`+`
	`13`	`+ # table[i] represents the number of ways to get to amount i`
`10`	`14`	`table = [0] * (n + 1)`
`11`	`15`
`12`		`- # Base case (If given value is 0)`
	`16`	`+ # There is exactly 1 way to get to zero(You pick no coins).`
`13`	`17`	`table[0] = 1`
`14`	`18`
`15`	`19`	`# Pick all coins one by one and update table[] values`
`16`	`20`	`# after the index greater than or equal to the value of the`
`17`	`21`	`# picked coin`
`18`		`- for i in range(0, m):`
`19`		`- for j in range(S[i], n + 1):`
`20`		`- table[j] += table[j - S[i]]`
	`22`	`+ for coin_val in S:`
	`23`	`+ for j in range(coin_val, n + 1):`
	`24`	`+ table[j] += table[j - coin_val]`
`21`	`25`
`22`	`26`	`return table[n]`
`23`	`27`
	`28`	`+`
`24`	`29`	`if __name__ == '__main__':`
`25`	`30`	`print(dp_count([1, 2, 3], 3, 4)) # answer 4`
`26`	`31`	`print(dp_count([2, 5, 3, 6], 4, 10)) # answer 5`

Comments

(0)