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.

 1 class Solution {
 2 public:
 3     bool isPalindrome(int x) {
 4         if(x<0) return false;
 5         if(x==0) return true;
 6         vector<int> v;
 7         while(x!=0)
 8         {
 9             v.push_back(x%10);
10             x=x/10;
11         }
12         int n=v.size();
13         int left=0;
14         int right=n-1;
15         while(left<right)
16         {
17             if(v[left]!=v[right])
18                 return false;
19             left++;
20             right--;
21         }
22         return true;
23     }
24 };

不使用额外内存的方法：

class Solution {
public:
    bool isPalindrome(int x) {
        if (x < 0) {
            return false;
        } else if (x / 10 == 0) {          //个位数默认为true
            return true;
        } else {
            int a = 0;
            int b = x;
            while (x != 0) {
                a = a * 10 + x % 10;       //不断取最后一位
                x = x / 10;                //取到去除最后一位的新值
            }
            if (a == b) {
                return true;
            } else {
                return false;
            }
        }
    }
};