斐波那契数列指的是这样一个数列 0, 1, 1, 2, 3, 5, 8, 13, 21, 34。这个数列每一项都等于前两项之和。
要求:请用户输入斐波那契数列的长度,并在控制台输出这一数列。自己写下加上别人的参考,第二个列子是自己参考别人的加上自己的理解。
Java代码实现:
package com.heima.StringBuffer;
import java.util.Scanner;
public class Test {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入斐波那契数列的长度:");
int n = sc.nextInt();
print(fibonacciRecursive(n));//递推
}
//递推斐波那契数列函数
public static int[] fibonacciRecursive(int n) {
int[] fibs = new int[n];
fibs[0] = 0;
fibs[1] = 1;
for (int i = 2; i < n; i++) {
fibs[i] = fibs[i - 2] + fibs[i - 1];
}
return fibs;
}
//打印斐波那契数列
public static void print(int[] fibs) {
for (int i = 0; i < fibs.length; i++) {
System.out.print(fibs[i] + " ");
}
}
}
两种方法实现:递推和递归 我写的有点繁琐,是把所有的都输出出来了。
package com.heima.StringBuffer;
import java.util.Scanner;
public class Feibonacci {
// 用递归
public static int fibonacciRecursive(int n) {
if (n == 0) {
return 0;
} else if (n <= 2) {
return 1;
} else {
return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2);
}
}
// 用递推
public static int fibonacciRecurrence(int n) {
int[] fibs = new int[n + 1];
if(n==0){
fibs[0] = 0;
}
else if(n==1){
fibs[1] = 1;
}
else {
for (int i = 2; i <= n; i++) {
fibs[0]=0;
fibs[1]=1;
fibs[i] = fibs[i - 1] + fibs[i - 2];
}
}
return fibs[n];
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入斐波那契数列的长度:");
int n = sc.nextInt();
System.out.println("请输入1(递归)或者2(递推)");
int num = sc.nextInt();
print(n, num);
}
public static void print(int n, int num) {
int[] fibs = new int[n];
if (num == 1) {
System.out.println("使用递归方法为:");
for (int i = 0; i <= n; i++) {
fibs[i] = fibonacciRecursive(i);
System.out.print(fibs[i] + " ");
}
} else if (num == 2) {
System.out.println("使用递推方法为:");
for (int i = 0; i <= n; i++) {
fibs[i] = fibonacciRecurrence(i);
System.out.print(fibs[i] + " ");
}
}
}
}