leetcode—Reverse Integer

Given a 32-bit signed integer, reverse digits of an integer.
Example 1:

Input: 123
Output: 321
Example 2:

Input: -123
Output: -321
Example 3:

Input: 120
Output: 21
Note:
Assume we are dealing with an environment which could only hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

class Solution {
    public int reverse(int x) {
        int res = 0;
        int new_res = 0;
        while(x!=0){
            new_res = res*10+x%10;
            if((new_res-x%10)/10!=res){
                return 0;
            }
            res = new_res;
            x = x/10;
        }
        return res;
    }
}

思路：主要是注意整数溢出，还有为负数的情况，如果处理溢出呢，如果一个正常的数值乘以在加上余数之后的结果溢出了，那么这个溢出的结果是无法复原刚才的这个值的，这个处理溢出的方法很巧妙