LintCode1070: Accounts Merge (并查集经典题)

1070. 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
Given

[
[“John”, "johnsmith@mail.com", "john00@mail.com"],
[“John”, "johnnybravo@mail.com"],
[“John”, "johnsmith@mail.com", "john_newyork@mail.com"],
[“Mary”, "mary@mail.com"]
]
Return

[
[“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.

You 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’]
]
is also acceptable.

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

[[“John”,“John5@m.co”,“John3@m.co”,“John1@m.co”],[“David”,“David3@m.co”,“David1@m.co”,“David1@m.co”],[“Lily”,“Lily2@m.co”,“Lily5@m.co”,“Lily0@m.co”],[“Isa”,“Isa2@m.co”,“Isa3@m.co”,“Isa2@m.co”],[“Bob”,“Bob0@m.co”,“Bob2@m.co”,“Bob1@m.co”]]

思路：并查集。
注意：

1. 此题的father不能只用数组，必须用map, string to string。
2. 此题必须以email为核心，因为某个email只可能属于某个人，而name则可能重名。
3. 把每个account的所有email都并到该account的第一个email。

代码如下：

class Solution {
public:
    /**
     * @param accounts: List[List[str]]
     * @return: return a List[List[str]]
     */
    vector<vector<string>> accountsMerge(vector<vector<string>> &accounts) {
        vector<vector<string>> result;
        
        for (auto account : accounts) {
            int len = account.size();
            for (int i = 1; i < len; ++i) {
                father[account[i]] = account[i];
                owner[account[i]] = account[0];
            }
        }
        
        // union all the emails under the same account
        for (auto account : accounts) {
            int len = account.size();
            for (int i = 2; i < len; ++i) {
                connect(account[i], account[1]); // let email1 be the root of all other emails under the same account
            }
        }
        
        for (auto account : accounts) {
            int len = account.size();
            for (int i = 1; i < len; ++i) {
                mp[find(account[i])].insert(account[i]);  //account[1] <-> set of account[i]s
            }
        }
        
        for (auto m : mp) {
            vector<string> record;
            record.push_back(owner[m.first]);
            record.insert(record.end(), m.second.begin(), m.second.end());  //there is no append() for C++ vector
            result.push_back(record);
        }
        
        return result;
    }
    
    
private:
    unordered_map<string, string> father;   //note it is a map instead of a vector
    unordered_map<string, string> owner;
    unordered_map<string, set<string>> mp;
    
    string find(string & s) {
        if (father[s] == s) return s;
        //path compression
        return father[s] = find(father[s]);
    }
    
    void connect(string & a, string & b) {
        string fatherA = find(a);
        string fatherB = find(b);
        if (fatherA != fatherB) father[fatherA] = fatherB;
    }
};