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.
public class Solution {
public boolean isPalindrome(int x) {
boolean isPalindrome = true;
if(x < 0)
isPalindrome = false;
else{
if(x % 10 == 0 && x != 0) //special case: ending with 0 but not 0
isPalindrome = false;
else{
int y = 0;
while(y < x){
y = (y * 10 + x % 10);
x /= 10;
}
if(y != x && y / 10 != x)
isPalindrome = false;
}
}
return isPalindrome;
}
}
leetcode--Palindrome Number,布布扣,bubuko.com
原文：http://www.cnblogs.com/averillzheng/p/3787800.html