(1)双端队列 from collections import deque def reverse(iterable): s = str(iterable) d = deque() d.extendleft(s) return ''.join(d) == s

output = filter(reverse, range(1, 1000)) print(list(output))

(2) 震惊.jpg。iterable.[::-1]直接翻转 def is_palindrome(n): return str(n) == str(n)[::-1] output = filter(is_palindrome, range(1,1000)) print (list(output))

(3)最开始自己的写的。大哭.gif def palindrome(n): x = str(n) s = list(x) n = len(s) - 1 m = 0 while True: if s[m] == s[n]: if m >= n: return True m += 1 n -= 1 else: return False

output = filter(palindrome, range(1, 1000)) print(list(output))