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.
负数不可能是回文数字
所以其实方法很简单:
对一个数x,得到其回文数n,判断二者是否相等即可。
class Solution {
public:
bool isPalindrome(int x) {
int n = 0;
int res = x;
while(x>0){
n = n*10+x%10;
x/=10;
}
return res==n;
}
};