java递归实现斐波那契数列

/**

*create Date:2016-12-23

*modified Date:2016-12-23

*modified by:shark

*Description:斐波那契数列

**/

public class Shulie{
public static long digui(int n,int sum,int before,int before1){

if(n==sum||n<=2){
if(n==1){
System.out.println(1);
return 1;
}
if(n==2){
System.out.println(1);
System.out.println(1);
return 1;
}
else{
System.out.println(before+before1);
return 1;
}
}
else{
if(sum<=2){
before1=1;
before=1;
sum++;
System.out.println(1);
return digui(n,sum,before,before1);
}
else{
int zhongjian=0;
zhongjian=before;
before=before+before1;
before1=zhongjian;
sum++;
System.out.println(before);
return digui(n,sum,before,before1);

}
}
}
//方法

public static void main(String[] args){//入口

digui(9,1,0,0);

}
}

因为暂时还不会再java中设置默认参数，尝试过但报错所以在参数看上去就有点多了。