def is_palindrome(n): s=str(n) x=0 for i in range(len(s)//2): if s[i]==s[len(s)-i-1]: x=x+1 if x==len(s)//2: return n 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
我的昵称有点长呢
def is_palindrome(n): s=str(n) x=0 for i in range(len(s)//2): if s[i]==s[len(s)-i-1]: x=x+1 if x==len(s)//2: return n 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('测试失败!')