def is_palindrome(n): n = str(n) l = len(n) if l == 1: return True else: for i in range(int(l / 2)): if n[i] != n[l - 1 -i]: return False return True
Sign in to make a reply
弱水三千_取一瓢饮
def is_palindrome(n): n = str(n) l = len(n) if l == 1: return True else: for i in range(int(l / 2)): if n[i] != n[l - 1 -i]: return False return True