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.
判断一个整数是否为回文数,不要用额外空间。
负数个位数不算回文数。
分别取出首位数字和末尾数字进行对比,代码很简单:
class Solution {
public:
bool isPalindrome(int x) {
if(x>=0 && x<10) return true;
if(x<0) return false;
int length=1;
while(x/length>=10)
{
length*=10;
}
while(x)
{
int left=x/length;
int right=x%10;
if(left!=right) return false;
x-=left*length;
x/=10;
length/=100;
}
return true;
}
};