递归实现阶乘：Python、Java 与 JavaScript 代码对比

Python 代码示例

python
def calculate_factorial(n):
    if n == 0 or n == 1:
        return 1
    else:
        return n * calculate_factorial(n - 1)

number = int(input("Enter a number: "))
print(f"The factorial of {number} is {calculate_factorial(number)}")

Java 代码示例

java
import java.util.Scanner;

public class Factorial {
    public static int calculateFactorial(int n) {
        if (n == 0 || n == 1) {
            return 1;
        } else {
            return n * calculateFactorial(n - 1);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print();
           scanner.nextInt();
        System.out.println( + number +  + calculateFactorial(number));
    }
}