Exercise of the factorial algorithm

Requirements: For a non-negative number, seeking its factorial

The use of recursion

JavaScript版：

function factorialize(num) {
    if(num === 0){
        num = 1;
    }else if(num == 1 || num == 2){
        num *= 1;
    }else{
        return num*factorialize(num-1);
    }
return num;
}

console.log(factorialize(5));//120

java version:

public class Test{
    public static void main(String[] args) {
        System.out.println(factorialize(5));;
    }

    private static int factorialize(int n) {
        if(n == 0){
            n = 1;
        }else if(n == 1 || n == 2){
            n *= 1;
        }else{
            return n*factorialize(n-1);
        }
        return n;
    }

}