剑指offer习题8

class Solution:
    def jumpFloor(self, number):
        # write code here
        if number == 1:
            return 1
        if number == 2:
            return 2
        lst = [1,2]
        i = 2
        while i <= number-1:
            lst.append(lst[i-1]+lst[i-2])
            i += 1
        return lst.pop()


sol = Solution()

print(sol.jumpFloor(3))

这个题和斐波那契数列很像，尽量用这种非递归的方法吧