def changeslowHelper(coinList, value): def changeslow(coins, change): minCoins = [0 for c in coins] minCoins[0] = change # now we recursively step through the algorithm at every level # and find the minimum amount for that level for coin in [c for c in coins if c <= change]: temp = (changeslow(coins, change - coin)) temp[coins.index(coin)] += 1 if sum(minCoins) > sum(temp): minCoins = temp bestSum = temp return (minCoins) finalCoins = changeslow(coinList, value) coinSum = sum(finalCoins) return (finalCoins, coinSum) coins =[1,2,3,4] print (changeslowHelper(coins, 11))
Run
Reset
Share
Import
Link
Embed
Language▼
English
中文
Python Fiddle
Python Cloud IDE
Follow @python_fiddle
Browser Version Not Supported
Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+
Firefox 4+
Safari 5+
IE 10+
Let me try anyway!
url:
Go
Python Snippet
Stackoverflow Question
