public class Task {
public static void main(String[] args) {
for (int i = 1; i <= 20; i++){
System.out.printf("斐波拉契数列 第" + i +"项 的值是:" + fibonacci_sequence(i) + "\n");
}
}
public static long fibonacci_sequence(long n) {
if ((n == 0) || (n == 1))
return n;
else
return fibonacci_sequence(n - 1) + fibonacci_sequence(n - 2);
}
}
(递归)斐波拉契数列 打印前20项
最新推荐文章于 2022-12-07 17:32:57 发布