- public class FibCalc {
- private static final int SIZE = 10;
- public static void main(String args[]) {
- //recursive method
- for (int i = 1; i <= SIZE; i++)
- System.out.println(fibonacci(i));
- }
- public static int fibonacci(int number){
- if (number == 0) {
- return 0;
- } else if (number == 1) {
- return 1;
- } else {
- return fibonacci(number-1) + fibonacci(number -2); //tail recursion
- }
- // int c0=0,c1=1;
- // for(int i=0;i<10;i++){
- // if(i==0){
- // System.out.println(c0);
- // }
- // else if(i==1){
- // System.out.println(c1);
- // }else{
- // c1=c0+c1;
- // c0=c1-c0;
- // System.out.println(c1);
- // }
- // }
- }
- }
- //该片段来自于http://www.codesnippet.cn/detail/190620149831.html
来源: http://www.codesnippet.cn/detail/190620149831.html