题目:来源leetcode 70.爬楼梯
假如当前有n阶台阶 ,在n-2阶和n-1阶有两种选择,方法等于n-2阶和n-1阶的方法之和:
class Solution:
def climbStairs(self, n: int) -> int:
a = []
a.append(1)
a.append(2)
if n - 1 == 0:
return 1
elif n - 1 == 1:
return 2
for i in range(2,n):
a.append(a[i-1] + a[i - 2])
return a[-1]