Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Classic dynamic programming solution in Clear category for Stair Steps by swagg010164
def checkio(a):
n = len(a)
dp = [a[0], max(a[0] + a[1], a[1])] + [0]*(n - 1)
for i in range(2, n + 1):
if i < n:
dp[i] = max(dp[i - 1], dp[i - 2]) + a[i]
else:
dp[i] = max(dp[i - 1], dp[i - 2])
return dp[n]
June 6, 2020
Comments:
