慕瓜9086354
快速性能测试显示Lutz的解决方案是最好的:import timedef speed_test(func):
def wrapper(*args, **kwargs):
t1 = time.time()
for x in xrange(5000):
results = func(*args, **kwargs)
t2 = time.time()
print '%s took %0.3f ms' % (func.func_name, (t2-t1)*1000.0)
return results return wrapper@speed_testdef compare_bitwise(x, y):
set_x = frozenset(x)
set_y = frozenset(y)
return set_x & set_y@speed_testdef compare_listcomp(x, y):
return [i for i, j in zip(x, y) if i == j]@speed_testdef compare_intersect(x, y):
return frozenset(x).intersection(y)# Comparing short listsa = [1, 2, 3, 4, 5]b = [9, 8, 7, 6, 5]compare_bitwise(a, b)compare_listcomp(a, b)compare_intersect(a, b)# Comparing longer listsimport random
a = random.sample(xrange(100000), 10000)b = random.sample(xrange(100000), 10000)compare_bitwise(a, b)compare_listcomp(a, b)compare_intersect(a, b)以下是我的机器上的结果:# Short list:compare_bitwise took 10.145 ms
compare_listcomp took 11.157 ms
compare_intersect took 7.461 ms# Long list:compare_bitwise took 11203.709 ms
compare_listcomp took 17361.736 ms
compare_intersect took 6833.768 ms很明显,任何人工性能测试都应该用盐来做,但因为set().intersection()答案是至少同样快作为其他的解决方案,也是最易读的,它应该是这个常见问题的标准解决方案。