public class Fibonacci {
public static void main(String[] args) {
long sum = fib2(50l);
System.out.println("斐波那契数列的第五十项是:" + sum);
}
public static long fib(Long n) {
if (n == 1 || n == 2) {
return 1;
} else {
return fib(n - 1) + fib(n - 2);
}
}
public static long fib2(long n) {
if (n == 1 || n == 2) {
return 1;
} else {
long t1 = 1;
long t2 = 1;
long t3 = 0;
for (long i = 3; i <= n; i++) {
t3 = t1 + t2;
t1 = t2;
t2 = t3;
}
return t3;
}
}
}
斐波那契数列的递归实现和循环实现
最新推荐文章于 2022-03-29 17:23:37 发布