Which of recursion method is better and why for reverse digits of integer?

Question

public static int recursiveReverse(int number, int reversenumber){

    if(number <= 0) {
        return reversenumber;
    }

    reversenumber = reversenumber *         


        

Answer 1

Have a go with the following:

public int rev(int n){
    if(n <= 0) {
        return n;
    }
    return Integer.parseInt("" + (n % 10) + rev(n / 10));
}

This way you don't need a temporary variable to hold state and it satisfies the return type. Hope this helps!! :)