以下是两个看似等价的函数,用于从数字列表中筛选出素数。
版本1
def prime (mylist):
for i in range(2, 8):
return filter(lambda x: x == i or x % i, mylist)第2版
def prime2 (mylist):
nums = mylist
for i in range(2, 8):
nums = filter(lambda x: x == i or x % i, nums)
return nums
print prime([2,3,4,5,6,7,8,9,10,11,12,13,14,15])
>> [2, 3, 5, 7, 9, 11, 13, 15]
print prime2([2,3,4,5,6,7,8,9,10,11,12,13,14,15])
>> [2, 3, 5, 7, 11, 13]版本1返回错误的结果。为什么?
发布于 2012-09-12 16:10:43
第一个版本只测试i == 2。换句话说,它只测试2是否是一个因子,而不是测试从2到7的所有整数。这就是为什么它会(正确地)过滤掉所有偶数,但会(错误地)保留不为素数的奇数,比如9和15。
def prime (mylist):
for i in range(2, 8):
print i # added to make things explicit; it's not necessary
return filter(lambda x: x == i or x % i, mylist)
def prime2 (mylist):
nums = mylist
for i in range(2, 8):
print i # added to make things explicit; it's not necessary
nums = filter(lambda x: x == i or x % i, nums)
return nums
print prime([2,3,4,5,6,7,8,9,10,11,12,13,14,15])
>>> 2
>>> [2, 3, 5, 7, 9, 11, 13, 15]
print prime2([2,3,4,5,6,7,8,9,10,11,12,13,14,15])
>>> 2
>>> 3
>>> 4
>>> 5
>>> 6
>>> 7
>>> [2, 3, 5, 7, 11, 13]发布于 2012-09-12 16:12:14
第一个函数在第一个循环迭代中返回,因此您永远不会针对i>2进行测试。
https://stackoverflow.com/questions/12392296
复制相似问题