题目要求:
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)
return false;
long result = 0;
int temp = x;
while(temp != 0)
{
result = result * 10 + temp % 10;
temp = temp / 10;
}
if(result > INT_MAX || result < INT_MIN)
return false;
if((int)result == x)
return true;
else
return false;
}
};