#!/usr/bin/env python3
#回数是指从左向右读和从右向左读都是一样的数，例如12321，909。请利用filter()筛选出回数：
def is_palindrome(n): if not isinstance(n,int): raise TypeError('must be int') m=str(n) mhalflen=int(len(m)/2) if len(m)== 1 : return True else: for j in range(mhalflen): if m[j] == m[-j-1] : return True else : return False
output = filter(is_palindrome, range(1, 1000)) print('1~1000:', list(output)) print(list(filter(is_palindrome, range(1, 200)))) 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('测试失败!')
Sign in to make a reply
Hello_景尊
#!/usr/bin/env python3
-- coding: utf-8 --
#回数是指从左向右读和从右向左读都是一样的数，例如12321，909。请利用filter()筛选出回数：
def is_palindrome(n): if not isinstance(n,int): raise TypeError('must be int') m=str(n) mhalflen=int(len(m)/2) if len(m)== 1 : return True else: for j in range(mhalflen): if m[j] == m[-j-1] : return True else : return False
测试:
output = filter(is_palindrome, range(1, 1000)) print('1~1000:', list(output)) print(list(filter(is_palindrome, range(1, 200)))) 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('测试失败!')