LEETCODE: 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.

可以参考 LEETCODE: Reverse Integer （http://blog.csdn.net/anyicheng2015/article/details/41848757）

class Solution {public:    bool isPalindrome(int x) {        if(x < 0)            return false;                    int reverse = 0;        int xcopy = x;        while(xcopy != 0)        {            reverse = reverse * 10 + xcopy % 10;            xcopy /= 10;        }                if(x == reverse)            return true;                return false;    }};