python - 查找两个嵌套列表的交集？

Question

我知道如何获得两个平面列表的交集:

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 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]]

你们能帮我解决这个问题吗？

相关

• Flattening a shallow list in python

Answer 1

您不需要定义交集。它已经是套装的一流部分了。

>>> b1 = [1,2,3,4,5,9,11,15]
>>> b2 = [4,5,6,7,8]
>>> set(b1).intersection(b2)
set([4, 5])