1.非递归版
class Solution:
def Fibonacci(self, n):
if n==0:
return 0
if n==1:
return 1
a = 0
b = 1
i=1
while(i<n):
h = a+b
a = b
b = h
i=i+1
return h
2.递归版
class Solution:
def Fibonacci(self, n):
if n==0:
return 0
if n==1:
return 1
return self.Fibonacci(n-1)+self.Fibonacci(n-2)