【LeetCode】Reverse Integer

题目

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer‘s last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).

注意，若反转后的数超出整型范围，则会变成负数，还有，注意处理反转的方法。

public class Solution {
    public int reverse(int x) {
        boolean position=(x<0)?false:true;
        int result=0;
        x=Math.abs(x);
        while(x>0){
            result=result*10+x%10;
            x/=10;
        }
        if(result<0)
            return -1;
        if(!position)
            result*=-1;
        return result;
    }
}

---EOF---

【LeetCode】Reverse Integer,布布扣,bubuko.com

【LeetCode】Reverse Integer

原文：http://blog.csdn.net/navyifanr/article/details/24905981