提交代码
class Solution {
public int reverse(int x) {
int tmp=x;
int ans=0;
while(tmp!=0) {
int num=tmp%10;
int max=ans/100000000;
int rest=(ans-max*100000000)*10+num;
if(ans>100000000||ans<-100000000) {
if(max>2||max<-2) return 0;
else if(rest>147483647||rest<-147483648) return 0;
}
ans=ans*10+num;
tmp/=10;
}
return ans;
}
}