*
*/
package test;
import java.util.Scanner;
/**
* @author lilin
*
*/
public class FibonacciTest {
// 獲取Fibonacci1數
public static int getFibonacci1(int count) {
if (count <= 1) {
return 1;
}
return getFibonacci1(count - 1) + getFibonacci1(count - 2);// 遞歸調用
}
/**
* @param args
*/
public static void main(String[] args) {
// 手動輸入獲取數列個數
Scanner sc = new Scanner(System.in);
System.out.println("請輸入要獲取的個數：");
int n = sc.nextInt();
int[] fibonaccil = new int[n];
for (int i = 0; i < n; i++) {
fibonaccil[i] = getFibonacci1(i);
System.out.print(fibonaccil[i]+" ");
}
// 倒序輸出
System.out.println("\n倒序輸出：");
for (int i = n - 1; i > -1; i--) {
fibonaccil[i] = getFibonacci1(i);
System.out.print(fibonaccil[i]+" ");
}
}
}