题解 | #跳台阶#

import math
def flog_jump(n):
    a = []
    if n==0:
        return [0,0]
    elif n == 1:
        return [1,0]
    elif n == 2:
        return [2,1]
    else:
        x = flog_jump(n-1)
        a = x[0]
        b = x[1]
        return [a+b, a]
if __name__ == "__main__":
    a = int(input())
    all_jump,_ = flog_jump(a)
    print(all_jump)

python 一次递归，避免超时