def is_palindrome(n):
c = str(n)
n = len(c)
count = 0
for i in range(n):
if c[i]==c[n-1-i]:
count+=1
if count>n/2:
return n
^_^找到了一位和我一样的小伙伴，我也是，学着python，想着C
Sign in to make a reply
里昂tcxy
def is_palindrome(n):
c = str(n)
n = len(c)
count = 0
for i in range(n):
if c[i]==c[n-1-i]:
count+=1
if count>n/2:
return n