class Solution {
public:
int reverse(int x) {
int positive = 1;
if(x < 0)
{
positive = -1;
x *=(-1);
}
unsigned int reverseX = 0;
while(x !=0)
{
if(reverseX > INT_MAX/10)//一定要判断是否溢出。
{
reverseX = 0;
break;
}
reverseX *= 10;
reverseX += x%10;
x = x/10;
}
return reverseX*positive;
}
};
LeetCode || Reverse Integer
最新推荐文章于 2019-05-09 21:31:42 发布