递归实现阶乘和斐波那契数列

话不多说直接上代码：

package recursion;

/**
 * Created by xiaobai on 2019/11/12.
 * 递归demo
 * @author xiaobai.
 * @DATE 2019/11/12
 */
public class Recursion {

    public static void main(String[] args) {
        int jieCheng = jieCheng(6);
        System.out.println(jieCheng);
        for (int i = 0; i < 10; i++) {
            int peiBoNaQie = peiBoNaQie(i);
            System.out.print(peiBoNaQie+"+");
        }
    }


    /**
     * 阶乘   1*2*3*4*5*...*(n-1)*n
     * @param n 阶乘到哪一位数
     * @return
     */
    private static int jieCheng(int n){
        if (n == 1) {
            return 1;
        }
        return n*jieCheng(n-1);
    }

    /**
     * 斐波那契数列
     * 1 1 2 3 5 8 13 21
     * @param n 加到哪一位
     * @return
     */
    private static int peiBoNaQie(int n){
        if (n == 1 || n==2) {
            return 1;
        }
        if (n == 0) {
            return 0;
        }
        return peiBoNaQie(n - 1) + peiBoNaQie(n - 2);
    }

}