比较有名的兔子问题,本质上体现的是斐波那契数列
有两种方法实现,一个是用数组迭代,一个是用函数递归
废话不多说,首先来看数组迭代的代码
import java.util.Scanner;
public class FeiBoNaQi {
public static void main(String[] args) {
System.out.println("请输入代数:");
Scanner sc = new Scanner(System.in);
int generation = sc.nextInt();
long[] arr = new long[generation];
arr[0] = 1;
arr[1] = 1;
for (int j = 2; j < arr.length; j++) {
arr[j] = arr[j - 1] + arr[j - 2];
}
System.out.println(arr[generation - 1]);
}
再来看函数递归的代码
import java.util.Scanner;
public class FeiBoNaQi {
public static void main(String[] args) {
System.out.println("请输入代数:");
Scanner sc = new Scanner(System.in);
int generation = sc.nextInt();
System.out.println(output(generation));
}
public static long output(int generation) {
if (generation == 1 || generation == 2) {
return 1;
} else {
return output(generation - 1) + output(generation - 2);
}
}
}
经过简单的测试,用数组实现的代码性能更高,主要优势体现在高代数上
输入100时,用递归实现的代码运算的很慢,但是用迭代实现的运算的依旧很快
如果有帮助到你,免费的赞来一个好吗,秋梨膏