反转一个整数

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.

反转整数没什么难的，关键在于两点：

（1）符号的处理；

（2）反转之后溢出的处理；

第一点很好处理，需要注意的是INT_MIN的绝对值比INT_MAX大1；最大的正数为2,147,483,647

第二点稍微麻烦一点，比如，对于1,534,236,469，怎么处理？

溢出处理的解决办法为int tenthmax = INT_MAX/10;用这个数探索全部填满整数位时候的合理性，注意代码中注释的部分。

有些答案给出的用long long存储数据判断溢出，是不合理的，因为，假如传入一个long long，你又该怎么办呢？

下面是5ms的C程序：

int reverse(int x) {
    if(x == INT_MIN)
        return 0;
    int num = abs(x);
    int rem, res = 0;
    int tenthmax = INT_MAX/10;
    
    while(num != 0)
    {
        rem = num%10;
        if((tenthmax<res) || (INT_MAX-10*res<rem))  //overflow
            return 0;
        res = 10*res + rem;
        num /= 10;
    }
    return x>0?res:-res;
}