面向对象编程和函数式编程demo

package org.example;

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int n = new Scanner(System.in).nextInt();
        System.out.println(recursionFunction(n));
        System.out.println(recursionObject(n));
    }

    /**
     * 函数式编程思维（递归） 用递归求N!=N*(N-1)*(N-2)*...*2*1;
     *
     * @param n 入参
     * @return 返回n的阶乘
     */
    private static int recursionFunction(int n) {
        if (n == 0 || n == 1) return 1;
        return n * recursionFunction(n - 1);
    }

    /**
     * 面向对象编程思维 求N!=N*(N-1)*(N-2)*...*2*1;
     *
     * @param n 入参
     * @return 返回n的阶乘
     */
    private static int recursionObject(int n) {
        int countNum = 1;
        if (n == 0 || n == 1) return countNum;
        for (int i = n; i > 0; i--) {
            countNum = countNum * i;
        }
        return countNum;
    }
}