Palindrome Number

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

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.

思路：

将数字的最高位和最低位进行异或，异或的结果加在一起，如果大于零则返回false，否则为true。注意负数都为false。

    bool isPalindrome(int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(x < 0)
            return false;
        if(x > -1 && x < 10)
            return true;
        int l = 0;
        int i;
        int t = x;
        while(t != 0){
            l++;
            t /= 10;
        }
        t = 0;
        while(t == 0 && l>1){
            t += (int)(x/pow(10,l-1))^(x%10);
            x %= (int)pow(10,l-1);
            x /= 10;
            l -= 2;
        }
        if(t == 0)
            return true;
        return false;
    }