class Solution:
def isPalindrome(self, x: int) -> bool:
count = 0
s = str(x)
if s[0] == "-": #若输入字符串为负
return False
else:
for i in range(len(s)):
count = count*10 +int(s[-i-1])
if x == count:
return True
else:
return False
主要思路为:先判断是否输入为负,若是,则必不可能为回文数,再将输入字符串化,反向提取,判断是否与输入相等