leetcode 9

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) {
        int r;
        int a=0;
        if(x<0||(x!=0&&x%10==0))
            return 0;
        while(x>a)
        {
            r=x%10;
            x=x/10;
            a=a*10+r;
        }
        if(x==a||a/10==x)
        return 1;
        else
            return 0;
    }
};

思路：

。判断回文不用新内存，不能使用数组，反转注意会有溢出，所以采用判断前后一半数字，判断条件就是反转后的数大于原数，这就涉及数字个数是偶数还是奇数，偶数判断是否相等，奇数先除十在判断，注意细节的是尾数为零的不是回文数，但零是回文数