大家写两行我写十行，我也太笨比了
def is_palindrome(n): s=str(n) l=len(s) if l%2==0: a = int(len(s)/2) for i in range(a): return s[i]==s[len(s)-i-1] else: a = int((len(s)+1)/2) for i in range(a): return s[i]==s[len(s)-i-1]
Sign in to make a reply
好吃的好吃的蹦蹦糖
大家写两行我写十行，我也太笨比了
def is_palindrome(n): s=str(n) l=len(s) if l%2==0: a = int(len(s)/2) for i in range(a): return s[i]==s[len(s)-i-1] else: a = int((len(s)+1)/2) for i in range(a): return s[i]==s[len(s)-i-1]