懂java的来，用递归法写程序，输出斐波那契数列 前30个数，而且每行输出五个数

public class Fibonacci {
public static void main(String[] args) {
getFibonacci(30);
}

private static int[] getFibonacci(int d){
int[] fib = new int[d];
fib[0] = 0;
fib[1] = 1;
for(int i = 2; i < fib.length; i++)
fib[i] = fib[i-1] + fib[i-2];
for(int i = 0; i < fib.length; i++)
System.out.print(fib[i] + " ");
System.out.println();
return fib;
}
}

public class Fibonacci {

public static void main(String[] args) {

for (int i = 0; i < 30; i++) {
System.out.print(fib(i) + " ");
}

}

public static int fib(int n) {
if (n < 3) {
return 1;
}
return (fib(n -2) + fib(n - 1));
}

}本回答被提问者采纳