不用切片
def is_palindrome(n): num = str(n) l = len(num) for i in range(l // 2): if num[i] == num[l-1 - i]: continue else: return False return True output = filter(is_palindrome, range(1, 1000)) print(list(output))
用了切片(原创:@并不会斗地主)
def is_palindrome(n): return str(n) == str(n)[:: -1] output = filter(is_palindrome, range(1, 1000)) print(list(output))
Sign in to make a reply
LesLieM樂
不用切片
用了切片(原创:@并不会斗地主)