//递归求第n个斐波那契数
public static int fib1(int order){
if (order == 1)return 0;
if (order == 2)return 1;
return fib1(order-1)+fib1(order-2);
}
//非递归
public static int fib2(int order){
if (order == 1)return 0;
if (order == 2)return 1;
int first = 0;
int second = 1;
int ans = 0;
int temp;
for (int i = 0; i < order - 2; i++){
ans = first+second;
temp = first;
first = second;
second = temp+second;
}
return ans;
}
求第n位斐波那契数,递归和非递归实现(n从1开始,Java实现)
最新推荐文章于 2024-10-14 16:01:29 发布