/* 斐波那契数列递归实现 */
public static int fibonacci(int n) {
if (n <= 1) return n;
return fibonacci(n-2) + fibonacci(n-1);
}
/* 斐波那契数列普通实现 */
public static int fibonacci2(int n) {
if (n <= 1) return n;
int a = 0;
int b = 1;
int res = 0;
for (int i = 2; i <= n; i++) {
res = a + b;
a = b;
b = res;
}
return res;
}
求斐波那契数列
最新推荐文章于 2023-11-28 04:33:41 发布