题目
有一段台阶有15级,以小明的脚力一步最多可以跨3级。请问小明登上这段楼梯有多少种不同的步法?
1. 递归
def stair(n):
if n < 0:
return 0
elif n < 3:
return n
elif n==3:
return 4
else:
return stair(n-1)+stair(n-2)+stair(n-3)
%timeit stair(15)
457 µs ± 7.33 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
2.动态规划
def stairDym(n):
a=0;b=0;c=1
if n < 0:
return 0
for n in range(n):
a,b,c = b,c,a+b+c
return c
%timeit stairDym(15)
1.54 µs ± 113 ns per loop (mean ± std. dev. of 7 runs, 1000000 loops each)