Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
recursion solution in Clear category for Stair Steps by mihaild
from functools import lru_cache
def checkio(numbers):
@lru_cache()
def best(start):
if start >= len(numbers):
return 0
if start == len(numbers) - 1:
return numbers[-1]
return numbers[start] + max(best(start + 1), best(start + 2))
return max(best(0), best(1))
#These "asserts" using only for self-checking and not necessary for auto-testing
if __name__ == '__main__':
assert checkio([5, -3, -1, 2]) == 6, 'Fifth'
assert checkio([5, 6, -10, -7, 4]) == 8, 'First'
assert checkio([-11, 69, 77, -51, 23, 67, 35, 27, -25, 95]) == 393, 'Second'
assert checkio([-21, -23, -69, -67, 1, 41, 97, 49, 27]) == 125, 'Third'
print('All ok')
July 18, 2014
Comments:
