/**
* 递归实现斐波那契数列
* @author XHQ
*
*/
public class Demo6 {
public static void main(String[] args) {
int array[] = new int[10];
for (int i = 0; i < array.length; i++) {
array[i] = digui(i + 1);
}
System.err.println(array.toString());
for (int i : array) {
System.err.println(i);
}
}
public static int digui(int i) {
if (i == 1 || i == 2) {
return 1;
}
return digui(i - 2) + digui(i - 1);
}
}