721. Accounts Merge

Description

Given a list accounts, each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails representing emails of the account.

Now, we would like to merge these accounts. Two accounts definitely belong to the same person if there is some email that is common to both accounts. Note that even if two accounts have the same name, they may belong to different people as people could have the same name. A person can have any number of accounts initially, but all of their accounts definitely have the same name.

After merging the accounts, return the accounts in the following format: the first element of each account is the name, and the rest of the elements are emails in sorted order. The accounts themselves can be returned in any order.

Example 1:
Input:
accounts = [[“John”, "johnsmith@mail.com", "john00@mail.com"], [“John”, "johnnybravo@mail.com"], [“John”, "johnsmith@mail.com", "john_newyork@mail.com"], [“Mary”, "mary@mail.com"]]
Output: [[“John”, ‘john00@mail.com’, ‘john_newyork@mail.com’, ‘johnsmith@mail.com’], [“John”, "johnnybravo@mail.com"], [“Mary”, "mary@mail.com"]]
Explanation:
The first and third John’s are the same person as they have the common email "johnsmith@mail.com".
The second John and Mary are different people as none of their email addresses are used by other accounts.
We could return these lists in any order, for example the answer [[‘Mary’, ‘mary@mail.com’], [‘John’, ‘johnnybravo@mail.com’],
[‘John’, ‘john00@mail.com’, ‘john_newyork@mail.com’, ‘johnsmith@mail.com’]] would still be accepted.
Note:

The length of accounts will be in the range [1, 1000].
The length of accounts[i] will be in the range [1, 10].
The length of accounts[i][j] will be in the range [1, 30].

Problem URL

---

Solution

给一系列的名字和对应的邮箱，将同一个人的所有邮箱合并，名字可能有重名。

Code

class Solution {
    public List<List<String>> accountsMerge(List<List<String>> accounts) {
        Map<String, Set<String>> graph = new HashMap<>();
        Map<String, String> name = new HashMap<>();
        
        for(List<String> account : accounts){
            String userName = account.get(0);
            for (int i = 1; i < account.size(); i++){
                if (!graph.containsKey(account.get(i))){
                    graph.put(account.get(i), new HashSet<>());
                }
                name.put(account.get(i), userName);
                
                if (i == 1){
                    continue;
                }
                graph.get(account.get(i)).add(account.get(i - 1));
                graph.get(account.get(i - 1)).add(account.get(i));
            }
        }
        
        Set<String> visited = new HashSet<>();
        List<List<String>> res = new ArrayList<>();
        
        for(String email : name.keySet()){
            List<String> list = new ArrayList<>();
            if (!visited.contains(email)){
                visited.add(email);
                dfs(graph, email, visited, list);
                Collections.sort(list);
                list.add(0, name.get(email));
                res.add(list);
            }
        }
        return res;
    }
    
    private void dfs(Map<String, Set<String>> graph, String email, Set<String> visited, List<String> list){
        list.add(email);
        for (String next : graph.get(email)){
            if (visited.add(next)){
                dfs(graph, next, visited, list);
            }
        }
    }
}

Time Complexity: O()
Space Complexity: O()

---

Review