509.斐波那契数列
# 递归完成斐波那契数列
class Solution:
def fib(self, N):
if N == 0 or N == 1:
return N
return self.fib(N - 1) + self.fib(N - 2)
s = Solution()
print(s.fib(2))
# 递归完成斐波那契数列
class Solution:
def fib(self, N):
if N == 0 or N == 1:
return N
return self.fib(N - 1) + self.fib(N - 2)
s = Solution()
print(s.fib(2))