思路 递归——时间复杂度太高了 代码 class Solution: def jumpFloor(self, number): # write code here if number<=2: return number for i in range(3,number+1): out= self.jumpFloor(i-1)+self.jumpFloor(i-2) return out 题解和斐波那契数列一样做即可