import static java.lang.System.*;
class NA_False {
public static void main(String[] args) {
int fibonacci = fibo(5);
System.out.println(fibonacci);
}
static int fibo(int n) {
if (n == 0 || n == 1) {
out.println(n);
return n;
}
else {
int n1 = fibo(n - 1);
int n2 = fibo(n - 2);
out.println((n1 + n2) + "=" + n1 + "+" + n2);
return n1 + n2;
}
}
}
我想說明我們如何得到每個斐波納契數,但是我得到了太多不必要的步驟。顯示斐波那契數的算術?
[看這裏](http://imagizer.imageshack.us/a/img440/2996/tu2.png) – 2015-03-31 20:12:39