动态规划
class Solution:
def climbStairs(self, n: int) -> int:
if n <= 2:
return n
a = [0, 1, 2]
step = 0
for i in range(3, n + 1):
step = a[i - 1] + a[i - 2]
a.append(step)
return step