无论元组顺序如何,都在两个元组列表中找到交集 [英] Finding the intersection in two lists of tuples regardless of tuple order
本文介绍了无论元组顺序如何,都在两个元组列表中找到交集的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
我有两个元组列表
listA = [('1','2'),('3','4'),('5','6')]
listB = [('2','1'),('7','8')]
即使第二个列表中元组的顺序不同,我也想找到它们的交集.
I want to find the intersection of them even if the order of the tuple in the second list is different.
因此,对于上面的示例:
So, for the example above:
intersection = [('1','2')]
交集应返回上面的元组,尽管它在listB中的顺序不相同
the intersection should return the tuple above though it is not in the same order in listB
如何在python中以最有效的方式做到这一点?因为我的每个列表都有大约2000个元组.
How can I do that in python the most efficient way? because each of my list has around 2000 tuples.
推荐答案
>>> set(map(frozenset, listA)) & set(map(frozenset, listB))
{frozenset({'1', '2'})}
请注意,这假定了元组的唯一性(即,没有元组('1','1')
).
Note that this assumes uniqueness in the tuples (i.e. there's no tuple ('1', '1')
).
这篇关于无论元组顺序如何,都在两个元组列表中找到交集的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文