def is_palindrome(n): L=str(n) n = int(len(L) / 2) return L[:n] == L[:-(n+1):-1]
def is_palindrome(n): return n and str(n) == str(n)[::-1]
Sign in to make a reply
Gday小海狮
def is_palindrome(n): L=str(n) n = int(len(L) / 2) return L[:n] == L[:-(n+1):-1]
def is_palindrome(n): return n and str(n) == str(n)[::-1]