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.

代码：

class Solution {
public:
    int reverse(int x) {
        
        int out = 0;
        int pop =0;
        while(x!=0){
            pop = x%10;
            x = x/10; //INT_MAX = 2147483647   INT_MIN = -2147483648
            if(out > INT_MAX/10 ||(out == INT_MAX/10 && pop >7)  ) return 0; // 先判断未乘10之前是否大于， 再判断个位是否大于
            if(out < INT_MIN/10 ||(out == INT_MIN/10 && pop <-8)) return 0;// 先判断未乘10之前是否小于， 再判断个位是否小于
            out = out*10 + pop;
        }     
        return out;
        
    }
};