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.

微软实习面试面了这道题。

2015年6月4日

如果一个数n是回文，a[1]a[2]...a[n]是其各位上的数字，那么数字a[n]a[n-1]...a[1]与n相等。

class Solution {
public:
    bool isPalindrome(int x) {
        int palindromeX = 0;
        int inputX = x;
        while(x>0){
            palindromeX = palindromeX*10 + (x % 10);
            x = x/10;
        }
        return palindromeX==inputX; 
        
    }
};

2014一般方法

注意如何得到一个数是几位数的方法，以及如何得到最左侧的数字。

class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0)
            return false;
        int base = 1;
        while(x/base >= 10)
        {
            base*=10;
        }
        while(x)
        {
            int lmdigit = x/base;
            int rmdigit = x%10;
            if(lmdigit != rmdigit)
                return false;
            x = (x-lmdigit*base) / 10;
            base/=100;
        }
        
        return true;
        
    }
};