Determine whether an integer is a palindrome. Do this without extra space.
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 the problem "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.
直接判断第一个和最后一个，循环往复。这样就不会对数字进行修改，而只是判断而已。
Java code:
1 public boolean isPalindrome(int x) { 2 if(x < 0 ) {return false;} //negative numbers are not palindrome 3 4 int div =1; 5 while(x/div >=10) { 6 div *=10; 7 } 8 9 //compare left and right digit number 10 while(x!=0) { 11 int left = x/div; 12 int right = x%10; 13 if(left != right) { 14 return false; 15 } 16 x = (x%div)/10; 17 div /=100; 18 } 19 return true; 20 }
Reference:
1. http://www.cnblogs.com/springfor/p/3889214.html
原文：http://www.cnblogs.com/anne-vista/p/4793497.html