class Solution:
    def JumpFloor(self, n):
        if n == 0:
            return 0;
        if n == 1:
            return 1;
        if n == 2:
            return 2;

        ret = 0
        a = 1
        b = 2
        for i in range(3, n + 1):
            ret = a + b
            a = b
            b = ret
        return ret

if __name__ == '__main__':
    print(Solution().JumpFloor(10))

当 n = 1   1
当 n = 2   2
当 n = 3   4
当 n = 4   8
当 n = n   2^(n-1)

class Solution:
    def jumpFloorII(self, number):
        return pow(2, number -1)

f(n) = f(n-1) + f(n-2) + ..... + f(1)
f(n-1) = f(n-2) + ..... + f(1)
# 我们结合上面的式子，移项可得
f(n) = 2f(n-1)，n > 1
f(1) = 1

class Solution:
    def JumpFloorII(self, n):
        if n == 1:
            return 1;
        ret = 0
        a = 1
        for i in range(2, n + 1):
            ret = 2 * a
            a = ret
        return ret

if __name__ == '__main__':
    print(Solution().JumpFloorII(10))