def is_palindrome(n):
strn=str(n)
strn=strn[::-1]
nf=int(strn)
return n==nf
判断回文数啊，123
123→字符串化→"123"→字符串倒序→"321"→数值化→321
Sign in to make a reply
yan32777
def is_palindrome(n):
strn=str(n)
strn=strn[::-1]
nf=int(strn)
return n==nf