我知道如何得到两个平面列表的交集:
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中扁平一个浅列表
当前回答
如果你想:
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中的每个子列表执行列表推导式。
其他回答
你不需要定义交集。它已经是集合的一流部分了。
>>> b1 = [1,2,3,4,5,9,11,15]
>>> b2 = [4,5,6,7,8]
>>> set(b1).intersection(b2)
set([4, 5])
纯列表理解版本
>>> 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]]
>>> c1set = frozenset(c1)
平变体:
>>> [n for lst in c2 for n in lst if n in c1set]
[13, 32, 7, 13, 28, 1, 6]
嵌套的变体:
>>> [[n for n in lst if n in c1set] for lst in c2]
[[13, 32], [7, 13, 28], [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
函数方法:
input_list = [[1, 2, 3, 4, 5], [2, 3, 4, 5, 6], [3, 4, 5, 6, 7]]
result = reduce(set.intersection, map(set, input_list))
它可以应用于更一般的1+列表
通过简化可以很容易地做出平面列表。
你只需要在reduce函数中使用初始化器-第三个参数。
reduce(
lambda result, _list: result.append(
list(set(_list)&set(c1))
) or result,
c2,
[])
上面的代码适用于python2和python3，但是你需要像从functools import reduce那样导入reduce模块。详情请参考下面的链接。
对于python2 对于python3
