【递归循环】斐波那契数列
2019-08-14 本文已影响0人
一个想当大佬的菜鸡
class Solution:
def Fibonacci(self, n):
# write code here
a, b = 0, 1
while n > 0:
b = a + b
a = b - a
n -= 1
return a
class Solution:
def Fibonacci(self, n):
# write code here
a, b = 0, 1
while n > 0:
b = a + b
a = b - a
n -= 1
return a
