【递归循环】斐波那契数列

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