Determine whether an integer is a palindrome. Do this without extra space.
Some hints:
思路2:将数字逆序,比较逆序后是否相等。
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.
思路1:比较数字头尾是否相当。
class Solution {
public:
bool isPalindrome(int x) {
if (x < 0)
{
return false;
}
int len = 1;
while (x / len >= 10)
len *= 10;
while (x > 0) {
int left = x / len;
int right = x % 10;
if (left != right) {
return false;
}
else {
x = (x % len) / 10;
len /= 100;
}
}
return true;
}
};
思路2:将数字逆序,比较逆序后是否相等。
class Solution {
public:
bool isPalindrome(int x) {
int temp = x;
long long reverse = 0;
if (x < 0)
{
return false;
}
while (temp > 0)
{
reverse = reverse * 10 + temp % 10;
temp = temp / 10;
}
return (reverse == x) ? true : false;
}
};