9. Palindrome Number | LeetCode

Determine whether an integer is a palindrome. Do this without extra space.

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.

第一种解法，通过取模和乘十来获得逆序后的数，再与原来的数对比，若相等则是回文数。代码如下：

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0) return false;
        int reverse = 0;
        int temp = x;
        while(temp > 0) {
            reverse = reverse * 10 + temp % 10;
            temp /= 10;
        }
        return reverse == temp;
    }
}

从上述方法容易想到，实际上若是回文数，则只需要比较数字前后两部分是否一样就行，没有必要将整个回文数逆序。所以我们可以将代码改进如下：

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0) return false;
        if(x < 10) return true;
        if(x % 10 == 0) return false;
        int reverse = 0;
        int temp = x;
        while(temp > reverse) {
            reverse = reverse * 10 + temp % 10;
            temp /= 10;
        }
        if(reverse > temp) reverse /= 10;
        return reverse == temp;
    }
}

有如下 test case 测试自己的代码：
1000110001 10 0 -121 1122 1001 220