简单题，动态规划
class Solution:
def climbStairs(self, n: int) -> int:
a, b = 1, 2
for _ in range(n - 2):
t = a + b
a = b
b = t
return b if n != 1 else 1
每日一题 70. 爬楼梯（简单）
2023-12-10 21:16:04 52 阅读
