用Lambda表达式递归计算斐波那契数列

package _5_27;

 

interface IntCall {

int call(int arg);

}

 

public class RecursiveFibonacci {

IntCall fib;

 

RecursiveFibonacci() {

fib = n -> n == 0 ? 0 : (n == 1 ? 1 : fib.call(n - 1) + fib.call(n - 2));

}

 

int fibonacci(int n) {

return fib.call(n);

}

 

public static void main(String[] args) {

RecursiveFibonacci rf = new RecursiveFibonacci();

for (int i = 0; i <= 10; i++) {

System.out.println(rf.fibonacci(i));

}

}

}