Nim*_*ika 5 python intersection list
这是我的两个清单;
k = [[1, 2], [4], [5, 6, 2], [1, 2], [3], [4], [5,9]]
kDash = [[1, 2], [4], [5, 6, 2], [1, 2], [3], [4], [5,6], [1,2]]
Run Code Online (Sandbox Code Playgroud)
我的输出应该如下;
[[1, 2], [4], [5, 6, 2], [1, 2], [3], [4]]
Run Code Online (Sandbox Code Playgroud)
我怎样才能得到这个输出?
先感谢您
您必须将列表转换为元组列表,然后使用交集。请注意,下面的解决方案可能具有不同顺序的元素,并且显然不会出现重复项,因为我使用的是 set。
In [1]: l1 = [[1, 2], [4], [5, 6, 2], [1, 2], [3], [4], [5,9]]
In [2]: l2 = [[1, 2], [4], [5, 6, 2], [1, 2], [3], [4], [5,6], [1,2]]
In [3]: [list(x) for x in set(tuple(x) for x in l1).intersection(set(tuple(x) for x in l2))]
Out[3]: [[1, 2], [5, 6, 2], [3], [4]]
Run Code Online (Sandbox Code Playgroud)
您也可以将交集保存在变量中并获取最终列表(如果需要顺序):
In [4]: intersection = set(tuple(x) for x in l1).intersection(set(tuple(x) for x in l2))
In [5]: [x for x in l1 if tuple(x) in intersection]
Out[5]: [[1, 2], [4], [5, 6, 2], [1, 2], [3], [4]]
Run Code Online (Sandbox Code Playgroud)
还有交叉路口,以防万一您有兴趣。
In [6]: print intersection
set([(1, 2), (5, 6, 2), (3,), (4,)])
Run Code Online (Sandbox Code Playgroud)
这对于大型列表来说效果很好,但如果列表很小,请通过@timegb探索其他解决方案(其解决方案对于较长的列表来说非常不理想)