剑指offer_python：斐波那契数列/跳台阶/变态跳台阶（循环）

斐波那契数列

大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项（从0开始，第0项为0，第1项是1）。
n≤39

# -*- coding:utf-8 -*-
class Solution:
    def Fibonacci(self, n):
        # write code here
        '''
        递归会超时，时间复杂度为2^n
        if n == 0:
            return 0
        if n == 1:
            return 1
        if n > 1:
            return = self.Fibonacci(n-1) + self.Fibonacci(n-2)
        '''
        # 循环时间复杂度为n
        if n == 0:
            return 0
        if n == 1:
            return 1
        last_one = 1
        last_two = 0
        for i in range(n-1):
            result = last_one + last_two
            last_two = last_one
            last_one = result
        return result
        

跳台阶

一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法（先后次序不同算不同的结果）。

class Solution:
    def jumpFloor(self, number):
        # write code here
        if number == 1:
            return 1
        if number == 2:
            return 2
        
        last_one = 2
        last_two = 1
        for i in range(number - 2):
            result = last_one + last_two
            last_two = last_one
            last_one = result
        return result

变态跳台阶

# -*- coding:utf-8 -*-
class Solution:
    def jumpFloorII(self, number):
        # write code here
        # f(n) = 2*f(n-1)
        if number == 1:
            return 1
        result = 1
        last_one = 1
        for i in range(number-1):
            result = 2*last_one
            last_one = result
        return last_one

        #return pow(2,number-1)