class Solution:
    """
    f(0) = 1
    f(1) = 1
    ...
    f(n-1) = f(n-2) + f(n-3) + ... + f(1) + f(0)
    f(n) = f(n-1) + f(n-2) + f(n-3) + ... + f(1) + f(0)
         = f(n-1) + f(n-1)
         = 2 * f(n-1)

    f(n) = 2^(n-1), n >= 1
    """
    def jumpFloorRecursive(self, number):
        if number <= 0:
            return -1
        if number == 1:
            return 1
        return 2 * self.jumpFloorRecursive(number - 1)

    def jumpFloorInduction(self, number):
        return 1 << (number - 1)

solution = Solution()
print(solution.jumpFloorInduction(100))
 

劍指offer：青蛙跳臺階