原理：取整数的前半段与后半段，对他们每一位进行比较。
def is_palindrome(n):
num = str(n)
div = len(num)//2
a = num[:div]
b = num[-div:]
f = 0
flag = 0
while f < div:
if a[f] == b[div - f -1]:
flag = flag + 1
f = f + 1
return n and flag == div output = filter(is_palindrome, range(1,90000))
print(list(output))
Nicktimebreak
原理：取整数的前半段与后半段，对他们每一位进行比较。 def is_palindrome(n): num = str(n) div = len(num)//2 a = num[:div] b = num[-div:] f = 0 flag = 0 while f < div: if a[f] == b[div - f -1]: flag = flag + 1 f = f + 1 return n and flag == div
output = filter(is_palindrome, range(1,90000)) print(list(output))