LeetCode 007 Reverse Integer

class Solution {
public:
    int reverse(int x) {
        long long reverseX=0;
        int isNegative=1;
        if(x<0){
            isNegative=-1;
            x*=-1;      //取正
        }
        while(x){
            reverseX=10*reverseX+x%10;
            x/=10;
        }
        reverseX*=isNegative;
        if(reverseX>INT_MAX)return INT_MAX;
        else if(reverseX<INT_MIN)return INT_MIN;
        return (int)reverseX;
    }
};