Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
My First, Recursive solution in Clear category for Stair Steps by d_rabenko
def checkio(numbers):
c = [0] * (len(numbers) + 1)
c[1] = numbers[0]
for i in range(2, len(numbers) + 1):
c[i] = max(c[i - 1], c[i - 2]) + numbers[i - 1]
return max(c[-1], c[-2])
#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'
assert checkio([5,4,3,-99,2,-20]) == 14, '4'
print('All ok')
Oct. 18, 2017