leetcode-7. Reverse Integer

class Solution {
public:
int reverse(int x) {
bool negtiveFlag = false;
if(x < 0)
{
negtiveFlag = true;
x = -x;
}
//为了防止潜在的溢出问题
long long result = 0;
while(x)
{
result = result*10 + x%10;
x /= 10;
}
if(negtiveFlag)
{
result = -result;
}
return (result < INT_MIN || result > INT_MAX)?0:(int)result;
}
};