题目：
Determine whether an integer is a palindrome. Do this without extra space.
Some hints:
Could negative integers be palindromes? (ie, -1)
If you are thinking of converting the integer to string, note the restriction of using extra space.
You could also try reversing an integer. However, if you have solved thePRoblem "Reverse Integer", you know that the reversed integer might overflow. How would you handle such case?
There is a more generic way of solving this problem.
思路：
两种解法，第一种就是reverse它，有溢出也不怕；第二种就是把跟它位数相同的10的最大次方求出来，然后同时除同时余，对比两边。
packagemanipulation;publicclassPalindromeNumber {publicbooleanisPalindrome(intx) {if(x < 0)returnfalse;inty =x;intresult = 0;while(y > 0) {
result= result * 10 + y % 10;
y= y / 10;
}returnx ==result;
}publicbooleanisPalindrome2(intx) {if(x < 0)returnfalse;inta = 1;while(x / a >= 10) {
a= a * 10;
}intleft = 0;intright = 0;while(x > 0 && a > 1) {
left= x /a;
right= x % 10;if(left != right)returnfalse;
x= (x % a) / 10;
a= a / 100;
}returntrue;
}publicstaticvoidmain(String[] args) {//TODO Auto-generated method stubPalindromeNumber p =newPalindromeNumber();
System.out.println(p.isPalindrome(1234567890));
}
}