def is_palindrome(n):

s = str(n)

s = s[::-1]

number = int(s)

return n - number == 0

--------------------------------一开始的i想法------------------------------------------------

def is_palindrome(n):

return int(str(n)[::-1]) - n == 0

----------------------------------------然后压缩行数------------------------------------