9.回文数

class Solution:
    def isPalindrome(self, x: int) -> bool:
        if x < 0:
            return False
        x = str(x)
        middle = int(len(x) // 2)
        if len(x) % 2 == 0:
            if len(x) == 2 and x[0] != x[1]:
                return False
            else:
                for i in range(0, len(x) - 1 - middle):
                    if x[middle + i] != x[middle - i - 1]:
                        return False
                return True

        else:
            if len(x) == 3 and x[2] != x[0]:
                return False
            else:
                for i in range(1, len(x) - 1 - middle):
                    if x[middle + i] != x[middle - i]:
                        return False
                return True


print(Solution().isPalindrome(10))