Determine whether an integer is a palindrome. Do this without extra space.
代码:
class Solution {
public:
bool isPalindrome(int x) {
if (x < 0) {
return false;
} else if (x < 10) {
return true;
}
int data[32];
int count = 0;
while (x) {
data[count++] = x % 10;
x /= 10;
}
for (int i=0; i<count/2; i++) {
if (data[i] != data[count - i - 1]) {
return false;
}
}
return true;
}
};