class Solution:
def climbStairs(self, n: int) -> int:
# 子问题:sub(n) = sub(n-1) + sub(n-2)
# 初始状态:dp[1] = 1, dp[2]=2
# 状态转移方程:dp[n] = dp(n-1) + dp(n-2)
# # 法一用字典存储,空间复杂度是O(n),时间复杂度也是O(n)
# dp = {}
# dp[1] = 1
# dp[2] = 2
# for i in range(3,n+1):
# dp[i] = dp[i-1] + dp[i-2]
# return dp[n]
# 法二用list存储
# if n < 3:
# return n
# dp = [0 for _ in range(n+1)]
# dp[1] = 1
# dp[2] = 2
# for i in range(3,n+1):
# dp[i] = dp[i-1] + dp[i-2]
# return dp[n]
# 法三只存储两个变量,空间复杂度变成了O(1),时间复杂度变成了O(n)
# if n==1 or n==2: return n
# a, b, tmp = 1,2,0
# for i in range(3, n+1):
# tmp = a + b
# a = b
# b = tmp
# return tmp