LeetCode(9) Palindrome Number

题目如下：

Determine whether an integer is a palindrome. Do this without extra space.

click to show spoilers.

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.

分析如下:

见代码

我的代码：

//708ms
class Solution {
public:
    bool isPalindrome(int x) {
        if (x<0)
            return false;
        int small = 0;
        int large = 0;
        int div = 1;
        while (x/div >= 10) { //这里是“大于等于”不是“大于”，case: 1001
            div *= 10;
        }
        while (x>0) {
            small = x % 10; //用 % 10求个位
            large = x/div; //用 /div求高位
            if (small != large)
                return false;
            x = (x % div) / 10;
            div = div / 100;
        }
        return true;
    }
};

update: 2014-01-23

虽然题目的提示说是，如果使用reverse integer的办法，需要处理溢出。可是实际上，1 处理这道题目的溢出非常简单。 

class Solution {
public:
    bool isPalindrome(int x) {
        if (x<0)
            return false;
        int res = 0;
        int y = x;
        while(x > 0) {
            if (res > INT_MAX/10 - 1) 
                return false;
            res = res* 10 + x % 10;
            x = x / 10;
        }
        return res == y;
    }
};