#include<stdio.h>
#include<string.h>
int Fib(int n)
{
int a = 1;
int b = 1;
int c = 0;
while(n>=3)
{
c = a+b;
a = b;
b = c;
n--;
}
return c;
}
int main()
{
int n = 0;
int fib = Fib(n);
scanf("%d",&n);
printf("%d\n",Fib);
return 0;
}
非递归实现找到第n个斐波那契数
阅读 128
2022-12-06
#include<stdio.h>
#include<string.h>
int Fib(int n)
{
int a = 1;
int b = 1;
int c = 0;
while(n>=3)
{
c = a+b;
a = b;
b = c;
n--;
}
return c;
}
int main()
{
int n = 0;
int fib = Fib(n);
scanf("%d",&n);
printf("%d\n",Fib);
return 0;
}
相关推荐
精彩评论(0)