necesito una funcion que haga el factorial recursivamente sin utilizar dos return

ublic static int factorial(int n) {
    if (n == 0) {
        return 1;
    } else {
        return n * factorial(n - 1);
    }
}

A:

You can use the following code to get the factorial of a number.
public static int factorial(int n) {
    int result = 1;
    for (int i = 1; i <=