斐波那契三角形Java实现

1
1 1 1
1 1 2 1 1
1 1 2 3 1 1
1 1 2 3 5 3 2 1 1
…

先写出求n点的斐波那契数，然后用运两层循环，一层循环是打印出第n层的数列，第二层循环从1到n层的数列。

public class Fibo {

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

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        for (int n=1; n<=m; n++) {
            for (int i = 1; i <= n; i++) {
                System.out.print(fib(i) + "\t");
            }
            for (int i = n-1; i >= 1; i--) {
                System.out.print(fib(i) + "\t");
            }
            System.out.println();
        }
    }
}