#include<stdio.h>
int Fib(int n){
if (n == 1 || n == 2){
return 1;
}
int last2 = 1;
int last1 = 1;
int cur = 0;
for (int i = 3; i <= n; ++i){
cur = last1 + last2;
last2 = last1;
last1 = cur;
}
return cur;
}
int main(){
printf("%d\n", Fib(4));
}
Fib数列
猜你喜欢
转载自blog.csdn.net/family_love_1998/article/details/86764114
今日推荐
周排行