Python recursive and non-recursive implementations of the Fibonacci sequence

Title Description Everyone knows the Fibonacci sequence, and now asks for an integer n, please output the nth item of the Fibonacci sequence (starting with 0, and the No. 0 item is 0).

n<=39

Recursive implementations:

Class solution ():    def Fibnacci (self,n):        if n <= 0:            return 0        if n = = 1: return            1        return self. Fibnacci (n-1) + self. Fibnacci (n-2)

Non-recursive implementations:

def Fibnacci (n):    result = [0,1]    if n <= 1:        return result[n] for    i in range (2,n+1):        Result.append (Result[i-1]+result[i-2])    return result[n]

Python recursive and non-recursive implementations of the Fibonacci sequence