Determine whether an integer is a palindrome. Do this without extra space.
注解:主要考虑越界问题
解1:把数分为左右两部分,右半块高低位颠倒
bool isPalindrome(int x) {
if( x < 0 || (x > 0 && x % 10 == 0) ) return false;
int l = x, r = 0;
while( l > r )
{
r *= 10;
r += l % 10;
l /= 10;
}
return (l == r) || (l == r/10);
}