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 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.
Solution: calculate the first and last digit separately, and compare, if they are not identical, return false, else continue to calculate next digits and compare.
public class Solution {
public boolean isPalindrome(int x) {
if (x < 0) {
return false;
}
int digit = 1;
while (digit <= x / 10) {
digit *= 10;
}
int left = x;
int right = x;
int count = 1;
while (digit > count) {
int r = right % 10;
right /= 10;
count *= 10;
int l = left / digit;
left %= digit;
digit /= 10;
if (r != l) {
return false;
}
}
return true;
}
}