算法—斐波那契苏

1,2,3,5,8,13,21,34,55,89,144....求偶数的和

 public static void main(String[] args) {

        for(int i=1;i < 20;i++) {

        System.out.printf("Fibonacci of %d is: %d\n",

                i, fibonacci(i));

        }

    }

    private static long fibonacci(long number) {

    if(number == 1 || number == 2) {

    return number;

    } else {

    return fibonacci(number - 1) + fibonacci(number - 2);

    }

    }