Another approach to ReverseInteger

[Dave Ziegler]

"For ReverseInteger I thought maybe you would like to see a different approach for this problem, this is what I would do:

public int reverse(int x) {
        int ne=x<0 ? -1 : 1;
        x=Math.abs(x);
        long a=x%10;
        x/=10;
        while (x!=0){
            a*=10;
            a+=x%10;
            if(a < Integer.MIN_VALUE || a > Integer.MAX_VALUE)return 0;
            x/=10;
        }
        return Long.valueOf(a*ne).intValue();
    }"

[TuWang]

1. No need to worry about the sign. The reversing operations singly on x, so sign won't change anyway.
2. No need to do the extra mode, and division outside of the loop.
3. sum and mod can be done in one line: rst = rst * 10 + x%10