def is_palindrome(n): def invert_str(s): list_str = s[-1] i = len(s) - 2 while i >= 0: list_str += s[i] i -= 1 return list_str n_str = str(n) size = len(n_str) if size == 1: return True left = n_str[:int(size / 2)] #取前一半的序列 right = n_str[-int(size / 2):] #取后一半的序列 if left == invert_str(right): return True return False
Sign in to make a reply
Jessica_tz