Leetcode Summary: Union Find

最新推荐文章于 2022-01-30 08:48:42 发布

OString24

最新推荐文章于 2022-01-30 08:48:42 发布

阅读量127

点赞数 1

CC 4.0 BY-SA版权

分类专栏： programming Leetcode 文章标签： union find

本文链接：https://blog.youkuaiyun.com/huntershuai/article/details/96423216

programming 同时被 2 个专栏收录

41 篇文章

订阅专栏

Leetcode

34 篇文章

订阅专栏

本文深入解析了AccountsMerge算法，该算法通过并查集处理账户信息合并的问题，实现了账户下所有邮箱地址的有效整合。文章详细介绍了并查集的find和union操作，并展示了如何利用这些操作来解决实际问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

721. Accounts Merge

class Solution(object):
    def accountsMerge(self, accounts):
        def find(a):
            if ds[a] < 0:
                return a
            ds[a] = find(ds[a])
            return ds[a]
        
        def union(a, b):
            a, b = find(a), find(b)
            if a != b:
                if ds[a] < ds[b]:
                    ds[a] += ds[b]
                    ds[b] = a
                else:
                    ds[b] += ds[a]
                    ds[a] = b

        c, ds, email_to_id, id_to_name = 0, [], {}, {}
        for account in accounts:
            for email in account[1:]:
                if email not in email_to_id:
                    email_to_id[email] = c
                    id_to_name[c] = account[0]
                    ds.append(-1)
                    c += 1
                union(email_to_id[account[1]], email_to_id[email])        
        res = {}
        for email, id in email_to_id.items():
            master = find(id)
            res[master] = res.get(master, []) + [email]
        return [[id_to_name[id]] + sorted(emails) for id, emails in res.items()]