def is_palindrome(n):
while n < 10:
return n
k = list(str(n))
i = 0
while k[i] == k[len(k)-i-1] and i < len(k)//2:
i += 1
Sign in to make a reply
用户9337653975
def is_palindrome(n):
while n < 10:
return n
k = list(str(n))
i = 0
while k[i] == k[len(k)-i-1] and i < len(k)//2:
return n
i += 1