剑指offer——面试题9：斐波那契数列

// ====================方法2：循环====================long long Fibonacci_Solution2(unsigned n){    int result[2] = {0, 1};    if(n < 2)        return result[n];    long long  fibNMinusOne = 1;    long long  fibNMinusTwo = 0;    long long  fibN = 0;    for(unsigned int i = 2; i <= n; ++ i)    {        fibN = fibNMinusOne + fibNMinusTwo;        fibNMinusTwo = fibNMinusOne;        fibNMinusOne = fibN;    }     return fibN;}