Reverse Integer

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

题目：整数各位数字上的反转。

分析：反转过程比较简单，取模与除。注意边界条件的处理，INT_MIN，及反转过来可能超出int表示范围的情况。

代码：

class Solution {
public:
    int reverse(int x) {
        if(abs(x)<10) return x;
        bool flag=false;
        long long t=x;
        if(x<0){ flag=true; t=-t;}
        long long res=0;
        while(t){
            res=res*10 + t%10;
            t=t/10;
        }
        if(res>INT_MAX) return ( flag? INT_MIN : INT_MAX); //如果结果溢出，返回边界值
        return (flag? (-1)*res: res);//条件表达式 ()? a:b;
        
    }
};