回数是指从左向右读和从右向左读都是一样的数，例如12321，909。请利用filter()筛选出回数

方法一：

# -*- coding: utf-8 -*-

def is_palindrome(n):
    for x,y in zip(str(n),str(n)[::-1]):
        if x==y:
            a=True
        else:
            a=False
            break
    return a

# 测试:
output = filter(is_palindrome, range(1, 1000))
print('1~1000:', list(output))
if list(filter(is_palindrome, range(1, 200))) == [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191]:
    print('测试成功!')
else:
    print('测试失败!')

测试结果：
1~1000: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 303, 313, 323, 333, 343, 353, 363, 373, 383, 393, 404, 414, 424, 434, 444, 454, 464, 474, 484, 494, 505, 515, 525, 535, 545, 555, 565, 575, 585, 595, 606, 616, 626, 636, 646, 656, 666, 676, 686, 696, 707, 717, 727, 737, 747, 757, 767, 777, 787, 797, 808, 818, 828, 838, 848, 858, 868, 878, 888, 898, 909, 919, 929, 939, 949, 959, 969, 979, 989, 999]
测试成功!

方法二：（精简）
将

def is_palindrome(n):
    for x,y in zip(str(n),str(n)[::-1]):
        if x==y:
            a=True
        else:
            a=False
            break
    return a

改为

def is_palindrome(n):
    return n==int(str(n)[::-1])