微信图片_20191218155751.jpg
class Solution:
def Fibonacci(self, n):
# write code here
if n == 0:
return 0
if n == 1:
return 1
if n > 1:
a = 0
b = 1
for i in range(n): ## 这个地方是n此循环
a, b = b, a + b
return a
