3

我有一长串长长的列表，所以效率对我来说是个问题。我想知道是否有一种更简洁的方法来比较列表列表，而不是在同一列表的循环中循环列表（通过示例更容易看到）

matchList=[]
myList = [ ('a',[1,2,3]), ('b', [2,3,4]), ('c', [3,4,5]), ('d', [4,5,6]) ]

tup_num=1
for tup in myList:
    for tup2 in myList[tup_num:]:
        id=str(tup[0])+':'+str(tup2[0])
        matches=set(tup[1]) & set(tup2[1])
        matchList.append((id,matches))
    tup_num+=1

print matchList

输出：

[('a:b', set([2, 3])), ('a:c', set([3])), ('a:d', set([])), ('b:c', set([3, 4])), ('b:d', set([4])), ('c:d', set([4, 5]))]

这有效并且不会重复比较，但我确信必须有更好的方法来做到这一点。

干杯

4

3 回答 3

2

使用itertools.combinations：

>>> import itertools
>>> matchList = []
>>> myList = [('a',[1,2,3]), ('b', [2,3,4]), ('c', [3,4,5]), ('d', [6,7,8])]
>>> matchList = [
...     ('{}:{}'.format(key1, key2), set(lst1) & set(lst2))
...     for (key1, lst1), (key2, lst2) in itertools.combinations(myList, 2)
... ]
>>> matchList
[('a:b', set([2, 3])), ('a:c', set([3])), ('a:d', set([])), ('b:c', set([3, 4])), ('b:d', set([])), ('c:d', set([]))]
于 2013-11-05T13:39:44.470 回答
1
  • 首先将这些列表转换为集合。这是一个 O(n) 操作，最好避免。
  • itertools.combinations 更快更容易。

像这样：

>>> from itertools import combinations
>>> l
[('a', [1, 2, 3]), ('b', [2, 3, 4]), ('c', [3, 4, 5]), ('d', [6, 7, 8])]
>>> l = [(i, set(j)) for i, j in l]
>>> l
[('a', {1, 2, 3}), ('b', {2, 3, 4}), ('c', {3, 4, 5}), ('d', {8, 6, 7})]
>>> [("%s:%s" % (l1[0], l2[0]), l1[1] & l2[1]) for l1, l2 in combinations(l, 2)]
[('a:b', {2, 3}), ('a:c', {3}), ('a:d', set()), ('b:c', {3, 4}), ('b:d', set()), ('c:d', set())]
于 2013-11-05T13:40:55.290 回答
1

使用组合和生成器可以清楚地表明：

from itertools import combinations

matchList = []
myList = [ ('a',[1,2,3]), ('b', [2,3,4]), ('c', [3,4,5]), ('d', [4,5,6]) ]

def sets(items):
  for name, tuple in items:
    yield name, set(tuple)

def matches(sets):
  for a, b in combinations(sets, 2):
    yield ':'.join([a[0], b[0]]), a[1] & b[1]

print list(matches(sets(myList)))


>>> [('a:b', set([2, 3])), ('a:c', set([3])), ('a:d', set([])), ('b:c', set([3, 4])), ('b:d', set([4])), ('c:d', set([4, 5]))]
于 2013-11-05T13:51:09.367 回答