标签：palindrome 回文 整数 leetcode 面试
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.
题目检测一个整数是不是回文整数，如12321就是一个回文整数。
class Solution {
public:
bool isPalindrome(int x) {
if (x < 0) return false;
int reverse = 0;
int power = 1;
while (x/power/10) {
power *= 10;
reverse = reverse * 10 + x/power%10;
}
return x%power == reverse;
}
};感觉还是比较新颖和独到。
以下收录了网上博客的常见写法，供大家比较：
方法一：
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 div = 1;
while(x/10 >= div){ // get large division
div *= 10;
}
while(x > 9){
int high = x / div; // left digit
int low = x % 10; // right digit
if(high != low){
return false;
}
x = (x % div) / 10; // get number between first and last
div /= 100;
}
return true;
}
};方法二（来源）：
class Solution {
public:
bool check(int x, int &y) {
if (x == 0) return true;
if (check(x/10, y) && (x%10 == y%10)) {
y /= 10;
return true;
} else {
return false;
}
}
bool isPalindrome(int x) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(x < 0) return false;
return check(x, x);
}
};标签：palindrome 回文 整数 leetcode 面试
原文地址：http://blog.csdn.net/elton_xiao/article/details/41929871
