Python 解决动态规划问题之 爬楼梯

问题描述

程序

def climb_stairs(n):
way = [0, 1, 2]
for i in range(3, n + 1):
way.append(way[i - 1] + way[i - 2])
return way

def easy_climb(n):
return easy_climb(n - 1) + easy_climb(n - 2) if n not in [0, 1, 2] else n

效率