习题解答
Topic source还可以用递归
def is_palindrome(n):
n=str(n)
if len(n) <= 1:
return True
else:
return n[0] == n[-1] and is_palindrome(n[1:-1])
output = filter(is_palindrome, range(1, 1000))
print(list(output))
- 1
还可以用递归
def is_palindrome(n):
n=str(n)
if len(n) <= 1:
return True
else:
return n[0] == n[-1] and is_palindrome(n[1:-1])
output = filter(is_palindrome, range(1, 1000))
print(list(output))
cherose_bj