斐波那契数列是一组第一位和第二位为1,从第三位开始,后一位是前两位和的一组递增数列,
像这样的:1、1、2、3、5、8、13、21、34、55......
#include <stdio.h>
long long Fbnl(int N) //非递归
{
int a1 = 0;
int a2 = 1;
int a3 = N;
printf(" 0 ");
for (int i = 2; i <N; i++)
{
printf("%2d ", a2);
a3 = a2 + a1;
a1= a2;
a2 = a3;
}
printf("\n");
return a3;
}
// 递归
//long long Fbnl(int N)
//{
// return N < 2 ? N : Fbnl(N - 1) + Fbnl(N - 2);
//}
int main()
{
int tmp = Fbnl(7);
printf("%d\n", tmp);
return 0;
}
---------------------
作者:时光若止~Dale
来源:CSDN
原文:https://blog.csdn.net/qq_36782456/article/details/72417876
版权声明:本文为博主原创文章,转载请附上博文链接!
今天,我们用四种方式来进行实现:
1.递归
int Fibon1(int n)
{
if (n == 1 || n == 2)
{
return 1;
}
else
{
return Fibon1(n - 1) + Fibon1(n - 2);
}
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = Fibon1(n);
printf("ret=%d", ret);
return 0;
}
2.非递归
int Fibno2(int n)
{
int num1 = 1;
int num2 = 1;
int tmp = 0;
int i = 0;
if (n < 3)
{
return 1;
}
else
{
for (i = 0; i>n-3; i++)
{
tmp = num1 + num2;
num1 = num2;
num2 = tmp;
}
return tmp;
}
}
3.数组
public int Fibno3(int n)
{
List<int> list = new List<int>();
list.fib(1);
list.fib(1);
int count = list.Count;
while (count < n)
{
list.fib(list[count - 2] + list[count - 1]);
count = list.Count;
}
return list[count - 1];
}
4.队列
public int Fibno4(int n)
{
Queue<int> queue = new Queue<int>();
queue.Enqueue(1);
queue.Enqueue(1);
for (int i = 0; i <= n - 2; i++)
{
queue.Enqueue(queue.AsQueryable().First() + queue.AsQueryable().Last());
queue.Dequeue();
}
return queue.Peek();
}
运行结果:
---------------------
作者:cherrydreamsover
来源:CSDN
原文:https://blog.csdn.net/cherrydreamsover/article/details/80026343
版权声明:本文为博主原创文章,转载请附上博文链接!