def is_palindrome(n): a=[] b=[] s = str(n) for i in range(len(s)): a.append(s[i]) b.append(s[len(s)-i-1]) for i in range(len(s)): if a[i]!=b[i]: return False else: return True print(is_palindrome(60355306))
Sign in to make a reply
何去何从gw
def is_palindrome(n): a=[] b=[] s = str(n) for i in range(len(s)): a.append(s[i]) b.append(s[len(s)-i-1]) for i in range(len(s)): if a[i]!=b[i]: return False else: return True print(is_palindrome(60355306))