1、斐波拉契数列
f(1) = 1; f(2) = 1; f(3) = f(1) + f(2);以此内推
1 x = 1
f(x) = 1 x = 2
f(x - 1) + f(x - 2) x >= 3
2、代码实现
#include <stdio.h>
#include <stdlib.h>
int fib1(int n)
{
if (n <= 0)
return -1;
else if (n == 1 || n == 2)
return 1;
else
return fib1(n - 1) + fib1(n - 2);
}
int fib2(int n)
{
if (n <= 0)
return -1;
int *a = malloc(sizeof(int) * n); //开辟了一个数组
a[1] = 1;
a[2] = 1;
for