4.13 leetcode -13 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).

这个题目，超界情况，本身给的函数是没法处理的。我记得，面试的时候做过这个题目，就是问超界怎么处理。

class Solution {
public:
    int reverse(int x) {
        int rx = 0;
        int flag = 0;
        if(x <0)
            {
            x = -x;
            flag = 1;
        }
        while(x>=10)
            {
            rx = rx*10 + x%10;
        	x = x/10;
        }
        rx = rx*10 + x;
        if(flag == 1)
            rx = -rx;
        return rx;
    }
};