No.9 Palindrome Number

No.9 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.

class Solution
{
public:
    bool isPalindrome(int x)
    {//判断整数是否为回文
     //限制：不允许使用额外空间
     //提示:负数是否为回文？；不能转换为string，因为不允许使用额外空间；反转数字的话，有可能溢出
     //用纯数学的方法，想清楚就好，别慌，敢下手!!!
     //参考：http://blog.csdn.net/linhuanmars/article/details/21145231
        if(x < 0)
            return false;//负数不是回文
        if(x == 0)
            return true;

        int base = 1;//用于取高位
        while(base <= x/10)
            base *= 10;

        while(x>0)
        {
            if(x/base != x%10)
                return false;

            x = (x%base)/10;//去首去尾
            base /= 100;//每次消去两位
        }
        return true;
    }
};

class Solution
{
public:
    bool isPalindrome(int x)
    {//判断整数是否为回文
     //限制：不允许使用额外空间
     //提示:负数是否为回文？；不能转换为string，因为不允许使用额外空间；反转数字的话，有可能溢出
     //参考：http://www.cnblogs.com/remlostime/archive/2012/11/13/2767676.html
        if(x < 0)
            return false;//负数不是回文
        if(x == 0)
            return true;

        int base = 1;//用于取高位
        while(base <= x/10)
            base *= 10;

        int leftDigit ;
        int rightDigit ; 
        while(x)
        {
            leftDigit = x/base;
            rightDigit = x%10;
            if(leftDigit != rightDigit)
                return false;

            x -= base*leftDigit;//去首
            base /= 100;//每次消去两位
            x /= 10;//去尾
        }
        return true;
    }
};