面试题答案
一键面试def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
def higher_order_function(func, lst):
return list(filter(func, lst))
lst = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
result = higher_order_function(is_prime, lst)
print(result)