[LeetCode] 721. Accounts Merge

题目描述

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].

输入是string 型的二维数组，数组的每一行代表账户信息，其中每一行的第一个元素代表用户名称，其他元素代表邮箱。认为有相同邮箱的账户属于同一账户。要求把所有属于同一账户的信息合并起来。
解决此题的思路是遍历数组构建树，把相同的email 连接起来，然后针对每个email 使用bfs 搜索找到属于同一用户的全部email并存储到set中。

C++ 实现

class Solution {
public:
    vector<vector<string>> accountsMerge(vector<vector<string>>& accounts) {
        unordered_map<string,vector<int>>  email_2_indices;
        for (int i = 0; i < accounts.size(); i++)
        {
            for (int j = 1; j < accounts[i].size(); j++)
            {
                if (email_2_indices.count(accounts[i][j]))
                {
                    email_2_indices[accounts[i][j]].push_back(i);
                }
                else
                {
                    email_2_indices[accounts[i][j]] = {i};
                }
            }
        }
        vector<vector<string>> res;
        unordered_set<string> visited;
        for (const auto email_2_index : email_2_indices)
        {
            const auto& email = email_2_index.first;
            const auto& index = email_2_index.second;
            const string& name = accounts[index[0]].front();
            vector<string> name_and_email;
            name_and_email.emplace_back(name);
            if(visited.count(email) == 0)
            {
                for (const auto& mail : bfs(accounts,email_2_indices,email,visited))
                {
                    name_and_email.emplace_back(mail);
                }
                res.emplace_back(name_and_email);
            }
        }
        return res;
    }

private:
    set<string> bfs(const vector<vector<string>>& accounts, 
                    const unordered_map<string,vector<int>>& email_2_indices,
                    const string& email,
                    unordered_set<string>& visited) const
    {
        set<string> res;

        queue<string> que;
        que.push(email);

        while(!que.empty())
        {
            const string front = que.front();
            res.insert(front);
            que.pop();
            if (visited.count(front) == 0)
            {
                const vector<int>& indices = email_2_indices.at(front);
                for (const int index : indices)
                {
                    for (int i = 1; i < accounts[index].size(); i++)
                    {
                        if (visited.count(accounts[index][i]) == 0)
                        {
                            que.push(accounts[index][i]);
                        }
                    }
                }
            }
            visited.insert(front);
        }

        return res;

    }
};