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.
提示:
负数能够是回文数吗?(例如 -1)
如果你想把数字转换为string类型,注意额外内存空间的限制。
你也可以尝试直接翻转一个整数,但是如果你已经解决了“Reverse Integer”问题,你应该注意到翻转一个整数可能导致溢出。你是如何解决溢出的呢?
有一个更为通用的方法来解决这个问题。(不好意思我想不出来。。。)
没什么特别的,按顺序比较即可,它那个通用方法我想不出来是啥,翻了discuss里的前几个C++方案思路也和我的大同小异。。。
class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
int left=0,right=0;
int temp=1;
while(x/temp>9)
temp*=10;
while(x>0)
{
left=x/temp;
right=x%10;
if(left!=right) return false;
x%=temp;
x/=10;
temp/=100;
}
return true;
}
};