斐波那契数列的递归和非递归实现 —— python

# -*- coding:utf-8 -*-
#递归实现
def Fibonacci(n):
    if n <= 1:
        return n
    return (Fibonacci(n-1) + Fibonacci(n-2))

#非递归实现
class Solution:
    def Fibonacci(self, n):
        a = [0,1]
        if n<2:
            return a[n]
        for i in range(2,n+1):
            a.append(a[i-1]+a[i-2])
        return a[n]