剑指offer 面试题9

题目：写一个函数，输入n，求斐波那契额数列的第n项。

#include<iostream>
using namespace std;

long long Fibonacci(unsigned int n)
{
    int result[] = {0,1};
    if (n < 2)
        return result[n];
    long long One = 1, Two = 0;
    long long fibN=0;
    for (unsigned int i = 2; i <= n; i++)
    {
        fibN = One + Two;
        Two = One;
        One = fibN;
    }
    return fibN;

}

int main()
{
    cout << Fibonacci(10);

    return 0;
}