Leetcode：7. Reverse Integer

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

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.
Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Example 4:

Input: -2147483648
Output: 0

Mycode

class Solution1 {
public:
    int reverse(int x) {
        int res=0;
        while(x)
        {
            int r=x%10; //r自带符号
            if((res>INT_MAX/10)||(res==INT_MAX/10&&r>7)) return 0;
            if((res<INT_MIN/10)||(res==INT_MIN/10&&r<-8)) return 0;
            res=res*10+r; //先判断再更新
            x/=10;
        }
        return res;
    }
};

class Solution2 {
public:
    int reverse(int x) {
        int rev = 0;
        while (x != 0) {
            int pop = x % 10;
            x /= 10;
            if (rev > INT_MAX/10 || (rev == INT_MAX / 10 && pop > 7)) return 0;
            if (rev < INT_MIN/10 || (rev == INT_MIN / 10 && pop < -8)) return 0;
            rev = rev * 10 + pop;
        }
        return rev;
    }
};

我们可以一次构建反转整数的一位数字。在这样做的时候，我们可以预先检查向原整数附加另一位数字是否会导致溢出。
注意点：2³¹-1=2147483647，-2³¹=-2147483648