9. 回文数

方法一：转为字符串

class Solution:
    def isPalindrome(self, x: int) -> bool:
        x_str = str(x)
        x_str_length = len(x_str)
        for i in range(int(x_str_length/2)):
            if not x_str[i] == x_str[x_str_length-1-i]:
                return False
        return True


print(Solution().isPalindrome(12321))

方法二：反转一半数字

class Solution:
    def isPalindrome(self, x: int) -> bool:
        if x < 0 or x != 0 and x % 10 == 0:
            return False
        revertedX = 0
        while x > revertedX:
            revertedX = revertedX*10+x % 10
            x = x//10
        return x == revertedX or x == revertedX//10


print(Solution().isPalindrome(12321))