我知道如何得到两个平面列表的交集:
b1 = [1,2,3,4,5,9,11,15]
b2 = [4,5,6,7,8]
b3 = [val for val in b1 if val in b2]
or
def intersect(a, b):
return list(set(a) & set(b))
print intersect(b1, b2)
但当我必须为嵌套列表找到交集时，我的问题就开始了:
c1 = [1, 6, 7, 10, 13, 28, 32, 41, 58, 63]
c2 = [[13, 17, 18, 21, 32], [7, 11, 13, 14, 28], [1, 5, 6, 8, 15, 16]]
最后我希望收到:
c3 = [[13,32],[7,13,28],[1,6]]
你们能帮我一下吗?
相关的
在python中扁平一个浅列表
当前回答
from random import *
a = sample(range(0, 1000), 100)
b = sample(range(0, 1000), 100)
print(a)
print(b)
print(set(a).intersection(set(b)))
其他回答
如果你想:
c1 = [1, 6, 7, 10, 13, 28, 32, 41, 58, 63]
c2 = [[13, 17, 18, 21, 32], [7, 11, 13, 14, 28], [1, 5, 6, 8, 15, 16]]
c3 = [[13, 32], [7, 13, 28], [1,6]]
下面是Python 2的解决方案:
c3 = [filter(lambda x: x in c1, sublist) for sublist in c2]
在Python 3中，filter返回一个可迭代对象而不是list，所以你需要用list()来包装filter调用:
c3 = [list(filter(lambda x: x in c1, sublist)) for sublist in c2]
解释:
过滤器部分获取每个子列表的项并检查它是否在源列表c1中。 对c2中的每个子列表执行列表推导式。
c1 = [1, 6, 7, 10, 13, 28, 32, 41, 58, 63]
c2 = [[13, 17, 18, 21, 32], [7, 11, 13, 14, 28], [1, 5, 6, 8, 15, 16]]
c3 = [list(set(i) & set(c1)) for i in c2]
c3
[[32, 13], [28, 13, 7], [1, 6]]
对我来说，这是非常优雅和快速的方法。
对于只想找到两个列表交集的人，Asker提供了两个方法:
B1 = [1,2,3,4,5,9,11,15] B2 = [4,5,6,7,8] B3 = [val for val in b1 if val in b2] 而且 Def相交(a, b): 返回列表(set(a) & set(b)) 打印相交(b1, b2)
但是有一种混合方法更有效，因为你只需要在list/set之间做一次转换，而不是三次:
b1 = [1,2,3,4,5]
b2 = [3,4,5,6]
s2 = set(b2)
b3 = [val for val in b1 if val in s2]
这将在O(n)中运行，而他最初的包含列表理解的方法将在O(n²)中运行
既然定义了intersect，一个基本的列表推导式就足够了:
>>> c3 = [intersect(c1, i) for i in c2]
>>> c3
[[32, 13], [28, 13, 7], [1, 6]]
多亏了S. Lott的评论和TM。的相关评论:
>>> c3 = [list(set(c1).intersection(i)) for i in c2]
>>> c3
[[32, 13], [28, 13, 7], [1, 6]]
我们可以使用set方法:
c1 = [1, 6, 7, 10, 13, 28, 32, 41, 58, 63]
c2 = [[13, 17, 18, 21, 32], [7, 11, 13, 14, 28], [1, 5, 6, 8, 15, 16]]
result = []
for li in c2:
res = set(li) & set(c1)
result.append(list(res))
print result
