First speedy solution for Stair Steps by wangjianyu557 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Speedy category for Stair Steps by wangjianyu557

def checkio(numbers):
    numbers.append(0)
    if len(numbers)>=2 and numbers[0]>0:
        numbers[1] += numbers[0]
    for i in range(2,len(numbers)):
        numbers[i] += max(numbers[i-2], numbers[i-1])
    #print(numbers)
    return numbers[i]

#print(checkio([5,4,3,-99,2,-20]))

Nov. 24, 2021

Comments:

Alex_4444D on Nov. 28, 2021, 11:25 a.m.
<p>Nice and simple solution I really like it!</p>

Mine

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.