斐波那契数列

package com.robert;
public class Main4 {
    public static void main(String[] args) {
        int f0 = 0, f1 = 1;
        int n = 6;
        System.out.println("第" + n + "项为" + getNumber(f0, f1, n));
    }

    private static int getNumber(int f0, int f1, int n) {
        int[] result = new int[n];
        result[0] = f0;
        result[1] = f1;
        for (int i = 2; i < n; i++) {
            result[i] = result[i - 1] + result[i - 2];
        }
        for (int j = 0; j < result.length; j++) {
            if (j == result.length - 1) {
                System.out.println(result[j]);
            } else {
                System.out.print(result[j] + ",");
            }
        }
        return result[n - 1];
    }
}