[LeetCode]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.

判断回文数字，只要能把这个数字反转过来，结果和原值相等，就说明这是个回文数字了。不过需要注意负数不是回文数字，

因为前后不对称（多了－号）。于是这道题就像提示里所说的一样，可以用之前做过的Reverse Integer这道题的方法来AC。

但需要注意溢出问题，因为原值是int型，因此为了方便，需要long long来解决问题了~

代码如下，欢迎各位大牛指导交流~

AC，Runtime: 272 ms

//LeetCode_Palindrome Number
//Written by zhou
//2013.11.13
class Solution {
public:
    bool isPalindrome(int x) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        
        if (x < 0)
           return false;
        
        long long reverse = 0;
        int y = x;
        int temp = 0;
        while (y != 0)
        {
            temp = y % 10;
            reverse = reverse * 10 + temp;
            y = y / 10;
        }
        if ((long long)x == reverse)
           return true;
        else return false;
        
    }
};