ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

lintcode 1070 Accounts Merge

2019-11-14 14:51:48  阅读:308  来源: 互联网

标签:sz emails self lintcode 1070 email Accounts root id


代码如下:

class UF(object):
    def __init__(self,email_lists):
        self.id={}
        self.sz={}
        self.name={}
        self.emails={}
        for email,name in email_lists.items():
            self.id[email]=email
            self.sz[email]=1
            self.name[email]=name
            self.emails[email]=set([email])
    
    def root(self,i):
        while i!=self.id[i]:
            self.id[i]=self.id[self.id[i]]
            i=self.id[i]
        return(i)
    
    def connected(self,p,q):
        return self.root(p)==self.root(q)
    
    def union(self,p,q):
        i=self.root(p)
        j=self.root(q)
        if i!=j:
            if self.sz[i]>self.sz[j]:
                self.id[j]=i
                self.sz[i]+=self.sz[j]
                self.emails[i] |= self.emails[j]
            else:
                self.id[i]=j
                self.sz[j]+=self.sz[i]
                self.emails[j] |= self.emails[i]
        

class Solution:
    """
    @param accounts: List[List[str]]
    @return: return a List[List[str]]
    """
    def accountsMerge(self, accounts):
        # write your code here
        if len(accounts)<=1: return(accounts)
        email_lists={}
        for account in accounts:
            for i in range(1,len(account)):
                email_lists[account[i]]=account[0]
        graph=UF(email_lists)
        for account in accounts:
            for i in range(1,len(account)-1):
                graph.union(account[i],account[i+1])
        ans=[]
        for email in graph.id.keys():
            if email==graph.id[email]:
                #print(graph.emails[email])
                #print(list(graph.emails[email]))
                #print(list(graph.emails[email]).sort())
                ans.append([graph.name[email]]+sorted(list(graph.emails[email])))
        return(ans)

 

标签:sz,emails,self,lintcode,1070,email,Accounts,root,id
来源: https://www.cnblogs.com/Leisgo/p/11857249.html

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有