任务描述 思路 与斐波那契数列同一个思路,f(n) = f(n-1)+f(n-2) 实现代码 class Solution: def climbStairs(self, n: int) -> int: if n <= 2: return n a = 1 b = 2 sum = 0 for i in range(n-2): sum = a + b a = b b = sum return sum