#回数是指从左向右读和从右向左读都是一样的数,例如12321,909。请利用filter()筛选出回数:
# -*- coding: utf-8 -*-
def is_palindrome(n):
for s in range(0,len(str(n))):
return str(n)[s] == str(n)[-s-1]
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('测试失败!')
Sign in to make a reply
子皞的十万个失眠夜
#回数是指从左向右读和从右向左读都是一样的数,例如12321,909。请利用filter()筛选出回数:
# -*- coding: utf-8 -*-
def is_palindrome(n):
for s in range(0,len(str(n))):
return str(n)[s] == str(n)[-s-1]
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('测试失败!')