斐波那契数列就是每次最后两个数值相加构成下一个数值,递归定义如下:
fibonacci 数列定义:
n = 1,2 时,fib(n) = 1
n > 2 时,fib(n) = fib(n-2) + fib(n-1)
其非递归实现如下:
int fabnacci(int n){
int a = 1;
int b = 1;
int c = 1;
if (n < 3)
{return 1;}
for (int i = 3; i <= n; i ++){
//return fabnacci(n -1) + fabnacci(n -2);
b = a + b;a = b - a;}
return b;
}