9. Palindrome Number

---

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Follow up:

Coud you solve it without converting the integer to a string?

题目很简单，判断一个数字是否是回文数，并且不使用额外的存储空间。

直接上代码吧。

    public static boolean isPalindrome(int x) {
        if(x < 0 ) return false;
        if (x == 0 || x / 10 == 0 || (x < 100 && x % 10 != 0)) return true;
        int result = 0;
        int backNumber = x;
        while (x > 0){
            result = result * 10 + x % 10;
            x /= 10;
        }
        return result == backNumber;
    }

先挑出能考虑到的特殊情况，首先负数带了符号，必不是回文数，其次除了能被10整除的数以外的任意两位数都是回文数，个位数都是回文数。

然后只需要将整数X给反序一下，判断是否和原始数字相等即可。

点击查看更多解法