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

#include<iostream>
#include<stdio.h>

using namespace std;

long long Fbc(int n)
{
	int result[2] = { 0, 1 };
	if (n < 2)
	{
		return result[n];
	}

	long long fibNMinusOne = 0;
	long long fibNMinusTwo = 1;
	long long fibN = 0;

	for (int i = 2; i <= n; i++)
	{
		fibN = fibNMinusOne + fibNMinusTwo;
		fibNMinusOne = fibNMinusTwo;
		fibNMinusTwo = fibN;
	}
	return fibN;
}

int main()
{
	int n;
	cin >> n;
	cout << Fbc(n) << endl;
	return 0;
}