数组储存
class Solution:
def climbStairs(self, n: int) -> int:
dp = [1, 2]
for i in range(2, n):
dp.append(dp[i-1] + dp[i-2])
return dp[n-1]
变量储存(滚动数组)
class Solution:
def climbStairs(self, n: int) -> int:
if n < 3:
return n
a, b, c = 1, 2, 3
for i in range(2, n-1):
a, b = b, c
c = a + b
return c