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) {
        if(x < 0 || (x != 0 && x % 10 == 0)) return false;// 这里考虑到 x 为负 或 最后一位为0的情况。能不能没有后一个判断？不能！因为如果不判断 例如当x = 10的时候 不成立
        int sum = 0;
        while(x > sum){// 这里x > sum 而不是 x > 0, 就避免了 x翻转过来后overflow的情况
            sum = sum * 10 + x % 10;
            x /= 10;
        }
        return x == sum || x == sum / 10;
    }
};