leetcode--回文数

挺简单的

bool isPalindrome(int x) {
if(x<0)
return false;
else
{
if(reverse(x) == -1)
return false;
if(x==reverse(x))
return true;
else
return false;
}

}

int reverse(int x)
{
int INTMAX = pow(2,32) - 1;
int num = 0;
while(x!=0)
{
int m = x%10;
x = x/10;
if((num==INTMAX/10&&m>7)||num>INTMAX/10)
return -1;
num = num*10 + m;
}
return num;
}