剑指offer十一：斐波那契数列

 

 

 

 

 

 

递归代码如下：

int Fibonacci(int n)
{
	if (n == 0)
		return 0;
	if (n == 1)
		return 1;
	else
		return Fibonacci(n - 1) + Fibonacci(n - 2);
}

循环代码如下：

int Fibonacci(unsigned int n)
{
	int result[] = { 0,1 };
	if (n < 2)
		return result[n];
	int pre = 0;
	int next = 1;
	int fib = 0;
	for (int i = 2; i <= n; i++)
	{
		fib = pre + next;
		pre = next;
		next = fib;
	}
	return fib;
}