无论元组顺序如何，在两个元组列表中查找交集

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')).

这篇关于无论元组顺序如何，在两个元组列表中查找交集的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持编程学习网！