面试题10：裴波那契数列

题目：求裴波那契数列的第N项

f(0) = 0; f(1) = 1; f(n) = f(n-1) + f(n-2) , n>1;

class Solution:
    def Fibonacci(self, n):
        result = [0, 1]
        if n<2:
            return result[n]
        fibNminusOne = 1
        fibNminusTwo = 0
        fibN = 0
        for i in range(2, n+1):
            fibN = fibNminusOne + fibNminusTwo
            fibNminusTwo = fibNminusOne
            fibNminusOne = fibN
        return fibN

if __name__=="__main__":
    solution = Solution()
    print(solution.Fibonacci(10))