//https://leetcode.com/problems/reverse-integer/
class Solution {
public:
int reverse(int x) {
if (x==0)
{
return 0;
}
long long a=x, ax=0;
int i=0;
vector<int> temp;
if (x<0)
{
a=-1*a;
}
while (a>0)
{
int back=0;
back=a%10;
a=a/10;
i=i+1;
ax=ax*10+back;
}
if (x<0)
{
ax=-1*ax;
}
if (ax > pow(2,31)-1 || ax < -pow(2,31)-1)
return 0 ;
if (ax > INT_MAX || ax < INT_MIN ) //两个判断都行
return 0 ;
return ax;
}
};