【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 store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

分析：此题思路较明确，相当于将一个整数逆置，只不过需要注意的是整数的范围是[−231,  231 − 1]，而题目也给了提示，超出范围返回0，所以只要注意处理上下边界即可。

代码：

class Solution {
public:
    int reverse(int x) {
        
        int res = 0, temp = 0;
        if(x == INT_MIN) return 0 ;
        
        if(x < 0) temp = 1 ;
        if(temp) x = -x ;
        
        while(x){
            if(res > INT_MAX / 10 || res == INT_MAX && x % 10 > 7)
                return 0 ;
            res *= 10;
            res += x % 10 ;
            x /= 10 ;
        }
        
        if(temp) res = -res ;
        return res ;
    }
};