LeetCode Easy 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.

Solution1

public class Solution1 {
    /**
     * 将数字转换成字符串，并检查字符串是否为回文
     * @param x
     * @return
     */
    public boolean isPalindrome(int x) {
        String s1 = String.valueOf(x);
        String s2 = new StringBuilder(s1).reverse().substring(0);
        return s1.equals(s2);
    }
}

Solution2

public class Solution2 {
    public boolean isPalindrome(int x) {
        // 特殊情况：
        // 当x<0时，x不是回文数
        // 如果数字的最后一位是0，只有第一位数字为0也就是只有0满足

        if (x < 0 || (x % 10 == 0 && x != 0)) return false;
        int revertedNumber = 0;
        while (x > revertedNumber) {
            revertedNumber = revertedNumber * 10 + x % 10;
            x /= 10;
        }
        // 当数字长度为奇数时，我们可以通过revertedNumber / 10去除
        // 位于中位的数字。例如，12321， 循环结束时x = 12, revertedNumber = 123，
        // 由于处于中位的数字不影响回文，所以我们可以简单地将其去除
        return x == revertedNumber || x == revertedNumber / 10;
    }
}