【剑指Offer】10 - 斐波那契数列

问题描述

解题思路

实现源码

class Solution {
public:
    int Fibonacci(int n) {
        int result[2] = {0,1};
        if (n < 2) {
            return result[n];
        }

        long long fibNum1 = 0;
        long long fibNum2 = 1;

        long long fibNum = 0;

        for (int i = 2; i <= n ; i++) {
            fibNum = fibNum1 + fibNum2;

            fibNum1 = fibNum2;
            fibNum2 = fibNum;
        }

        return fibNum;
    }
};