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.
这道题,不断地取第一位和最后一位进行比较,相等则取第二位和倒数第二位,直到完成了比较或遇到了不相等的位。
class Solution {
public:
bool isPalindrome(int x) {
if (x < 0)
return false;
int d = 1;
while (x / d >= 10)
d *= 10;
while (x > 0) {
int q = x / d;
int r = x % 10;
if (q != r)
return false;
x = x % d / 10;
d /= 100;
}
return true;
}
};