def is_palindrome(n): s = [] while n != 0: s = s + [n % 10] n = n // 10 i = 0 while i < (len(s) // 2): if s[i] != s[-i - 1]: return False i = i + 1 return True
Sign in to make a reply
沙耶子Ver3
def is_palindrome(n): s = [] while n != 0: s = s + [n % 10] n = n // 10 i = 0 while i < (len(s) // 2): if s[i] != s[-i - 1]: return False i = i + 1 return True