Palindrome Number

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.

由于要在O(1)空间内完成，思路就是将参数int转置后，与原来的int做对比，相等就说明是回文的。还有一种思路是找到中间位置，当遍历到中间位再去做比较，如12321,处理后得到a = 123,b = 123，就不需要将整个数反转。缺点是需要知道int的长度，还要分为奇偶来考虑，过于麻烦。

bool isPalindrome(int x) {
        if(x < 0){     //负数显然不合法
            return false;
        }
        int n = 0, check = x;
        while(x > 0){
            n *= 10;
            n += x % 10;
            x /= 10;
        }
        if(n == check)
            return true;
        else
            return false;
    }