Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def kovanci(i,sez):
- '''
- Vrne optimalno vsoto kovancev. Rekuzivno z memoizacijo.
- '''
- kateri = []
- vsote = dict()# uporabimo memoizacijo
- if i == 1:
- if i not in vsote:
- vsote[1] = sez[0]
- return vsote[1]
- if i == 2:
- if i not in vsote:
- vsote[2] = max(sez[0], sez[1])
- return vsote[2]
- if i not in vsote:
- najvecja = max(sez[i-1] + kovanci(i-2,sez),kovanci(i-1,sez))
- vsote[i] = najvecja
- return vsote[i]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement