输出指定长度的斐波那契数列

输出指定长度的斐波那契数列

import java.util.Scanner;

public class Fbonacci {

	// 递归做法
	static int fib(int n) {
		if (n == 1) {
			return 1;
		}
		if (n == 2) {
			return 1;
		} else {
			n--;
			return fib(n) + fib(n - 1);
		}

	}

	public static void main(String[] args) {

		System.out.print("请输入一个整数：");
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int[] a = new int[100];
		a[0] = 1;
		a[1] = 1;
		for (int i = 2; i < n; i++) {
			a[i] = a[i - 1] + a[i - 2];
		}

		for (int i = 0; i < n; i++) {
			System.out.print(a[i] + " ");
		}

		// 递归做法
		System.out.println();
		for (int i = 0; i < n; i++) {
			System.out.print(fib(i + 1) + " ");
		}
	}

}