翻转整数 Reverse Integer

为什么80%的码农都做不了架构师？>>>   

问题：

Reverse digits of an integer.

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

Have you thought about this?

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?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

解决：

① 正常翻转，但是要注意边界问题，即使输入数字不溢出，在翻转过程中也有可能会存在溢出问题。

public class Solution {//38 ms
    public int reverse(int x) {
        if(x > 0x7fffffff || x < 0x80000000)return 0;
        long res = 0;  
        while(x != 0){  
            res = res * 10 + x % 10;  
            if(res > 0x7fffffff || res < 0x80000000) return 0;//溢出问题处理，注意，本题反转的是带符号整数,【注意】要在处理之后再判断，否则，若为负数，结果错误
            x /= 10;  
        }  
        return (int)res;    
    }
}

②

public class Solution {
    public int reverse(int x) {
        int result = 0;
        while(x != 0){
            int tail = x % 10;
            int newResult = result * 10 + tail;
            if((newResult - tail) / 10 != result) return 0;//还是上一种判别方法比较好
            result = newResult;
            x = x / 10;
        }
        return result;
    }
}

 

转载于:https://my.oschina.net/liyurong/blog/1143061