斐波那契数列: 形如
1 2 3 5 8 13 21 ............
一、递归求解
#include <stdio.h>
#include <stdlib.h>
int Fibonacci(int n)
{
int a = 1;
int b = 2;
if (n == 1)
{
return a;
}
else if (n == 2)
{
return b;
}
else
{
return Fibonacci(n - 2) + Fibonacci(n - 1);
}
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = Fibonacci(n);
printf("%d\n", ret);
system("pause");
return 0;
}