使用递归方法，求斐波那契数列的前n项
关注
关注
关注
package 两个题3_17;
import
java.util.Scanner;
public class Main {
/*
许昌学院
*/
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("请你输入整数:");
int n = scanner.nextInt();
System.out.print("斐波那契数列为：");
for (int j = 1; j <= n; j++) {
if(j<n) {
System.out.print( fib (j)+",");
}else {
System.out.println( fib (j));
}
}
scanner.close();
}
private static int fib(int i) {
if (i == 1 || i == 2) {
return 1;
} else {
return fib (i - 1) + fib (i - 2);
}
}
}
