Determine whether an integer is a palindrome. Do this without extra space.
Some hints:
» Solve this problem
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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (x < 0) {
return false;
}
int temp = x, reverseX = 0;
while (temp > 0) {
reverseX = reverseX * 10 + temp % 10;
temp /= 10;
}
return x == reverseX;
}
};
public class Solution {
public boolean isPalindrome(int x) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (x < 0) {
return false;
}
int temp = x, rx = 0;
while (temp > 0) {
rx = rx * 10 + temp % 10;
temp /= 10;
}
return rx == x;
}
}