def is_palindrome(n):
p = str(n)
if len(p) == 1:
return True
if len(p) % 2 == 0:
mid = int(len(p)/2)
return p[:mid] == p[mid:]
else:
right = mid + 1
return p[:mid] == p[right:]
Sign in to make a reply
是的201610
def is_palindrome(n):
p = str(n)
if len(p) == 1:
return True
if len(p) % 2 == 0:
mid = int(len(p)/2)
return p[:mid] == p[mid:]
else:
mid = int(len(p)/2)
right = mid + 1
return p[:mid] == p[right:]