自下而上
class Solution:
def fib(self, N: int) -> int:
#f(0) = 0
#f(1) = 1
if N == 0:
return 0
elif N == 1:
return 1
l1 = 0
l2 = 1
temp = 1
res = 1
while temp < N:
res = l1 + l2
l1 = l2
l2 = res
temp += 1
return res
基本递归(时间复杂度高)
class Solution:
def fib(self, N: int) -> int:
#f(0) = 0
#f(1) = 1
if N == 0:
return 0
elif N == 1:
return 1
return self.fib(N-1) + self.fib(N-2)