How to reverse a number in java with single variable using recursion? [duplicate]

Question

//Is there any simple idea other than it?
static int rev(int n){
    if (n==0)return 0;
    else return n%10^10+rev(n/10)   
}

I want to reverse number with single variable and recursion.

I did see the same answer later on but i was asking reversing a number with single variable. — Milan Malla
– Milan Malla, Commented Mar 16, 2017 at 13:26

Milan Malla · Accepted Answer · 2017-03-16 13:13:32Z

0

//Here i got the idea.
public static void main(String[] args) {
    // Let the number be 139.
    int n=139;
    System.out.println("reverse is "+rev(n));
}
static int rev(int n){
    if (n<10)return n;
    else return n%10*(int) Math.pow(10,(int)Math.log10(n))+rev(n/10);
        //Math class is used to return the number of digits and power.
}

This gives:: reverse is 931

edited Mar 16, 2017 at 13:13

answered Mar 16, 2017 at 13:03

Milan Malla

214 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

How to reverse a number in java with single variable using recursion? [duplicate]

1 Answer 1

Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Linked

Related