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.

首先无耻的把reverse int 返回改为long来避免overflow, 因为是镜像，所以不变。。。

class Solution {
public:
    bool isPalindrome(int x) {
        if (x<0)
            return false;
        if (x<10)
            return true;
        return long(x)-reverseInt(x)==0;
    }
    long reverseInt(int x)
    {
        long res=0;
        while(x)
        {
            res=res*10+x%10;
            x=x/10;
        }
        return res;
    }
};

如果不偷懒，那就要一步一步的check...先算数量级，然后用数量级divide,用10算mod, 比一下，同时数量级/100。 最后如果scale=1,那就是奇数位，肯定是，如果是偶数位，scale=10,再判断下。

class Solution {
public:
    bool isPalindrome(int x) {
    
        if (x<0)
            return false;
        if (x<10)
            return true;
        int scale=1;
        int tmp=x;
        while(tmp>9){
            tmp/=10;
            scale*=10;
        }
        while(scale>10 && x>10){
            int bgn=x/scale;
            int end=x%10;
            if (bgn!=end)
                return false;
            x=(x-bgn*scale-end)/10;
            scale=scale/100;
        }
        if (scale==1)
            return true;
        return x/scale==x%scale;
    }
};