跳跃游戏||

l = [2, 3, 1, 1, 4]
n = len(l)
maxpro, end, step = 0, 0, 0
for i in range(n-1):
    maxpro = max(maxpro, i + l[i])
    if end == i:
        end = maxpro
        step += 1
print(step)