【LeetCode（算法）】Reverse digits of an integer(反转整型数字）

题目在这

Reverse digits of an integer.

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

click to show spoilers.

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?

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).

除了要反转数字外，我们还要考虑特殊情况，溢出和尾数为零

class Solution {
public:
    int reverse(int x) {
        long long res = 0;
        while(x != 0)
        {
            res = res * 10 + x % 10;
            x /= 10;
            if( x >= INT_MAX)
              return INT_MAX;
            if(x <= INT_MIN)
             return INT_MIN;
        }
        return res;
    }
};