【python3】leetcode 509. Fibonacci Number（easy）

509. Fibonacci Number（easy）

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

F(0) = 0,   F(1) = 1
F(N) = F(N - 1) + F(N - 2), for N > 1.

Given N, calculate F(N).

 

Example 1:

Input: 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.

Example 2:

Input: 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.

Example 3:

Input: 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.

斐波那契数列，真的是很经典又很基础的递归题了，但是这次第一次用迭代做，速度比递归快不少

 

class Solution:
    
    def fib(self, N):
        """
        :type N: int
        :rtype: int
        """
        if N==0: return 0
        pre = 1 #f(n-1)
        ppre = 0 #f(n-1)
        for i in range(1,N):
            pre,ppre =  pre+ppre,pre
            
        return pre

补充递归写法

class Solution:
    def fibonacci(self,n):
        if n == 0:return 0
        elif n == 1:return 1
        else:return self.fibonacci(n-1) + self.fibonacci(n-2) 
    def fib(self, N):
        """
        :type N: int
        :rtype: int
        """
        return self.fibonacci(N)