-- coding:utf-8 -- class Solution: def jumpFloorII(self, number): # write code here a=1 b=2 if number==1: return 1 elif number==2: return 2 lst=[a,b] for i in range(number-2): c = sum(lst) + 1 lst.append(c) return lst[-1] 时间复杂度:n?空间复杂度:怎么算?