您可以为此使用Unionfind algorithm.首先,我们使用字典从这些对中创建一棵树:
leaders = collections.defaultdict(lambda: None)
现在,我们使用两个函数(union和find)填充该树:
def find(x):
l = leaders[x]
if l is not None:
l = find(l)
leaders[x] = l
return l
return x
def union(x, y):
lx, ly = find(x), find(y)
if lx != ly:
leaders[lx] = ly
只需遍历所有对,然后将它们放入树中即可.
for a, b in [(1,2),(3,4),(5,6),(3,7),(5,7)]:
union(a, b)
然后看起来像这样:{1:2,2:None,3:4,4,:7,5:6,6,6:7,7:None}
最后,我们将数字按各自的“领导者”分组,即find返回的内容:
groups = collections.defaultdict(set)
for x in leaders:
groups[find(x)].add(x)
现在,groups.values()为[set([1,2]),set([3,4,5,6,7])]
复杂度应约为O(nlogn).