题目:https://leetcode-cn.com/problems/reverse-integer/
代码:
class Solution {
public:
int reverse(int x) {
//当前值
int rev = 0;
//被弹出的值
int pop = 0;
while(x!=0)
{
int pop = x%10;
x = 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;
}
};
结果: