**Leetcode 721. Accounts Merge

https://leetcode.com/problems/accounts-merge/description/

并查集，，，没想到现在线上都开始考并查集了。。。

参考了 https://leetcode.com/problems/accounts-merge/discuss/109157/JavaC++-Union-Find

class Solution {
public:
    vector <vector<string> > accountsMerge(vector<vector<string>>& acc) {
        unordered_map<string, string> parent;
        unordered_map<string, string> own;
        unordered_map<string, set<string> > acc_union;
        for (int i = 0; i < acc.size(); i++) {
            // parent[ acc[i][0] ] = parent[ acc[i][0] ];
            for (int j = 1; j < acc[i].size(); j++) {
                own[ acc[i][j] ] = acc[i][0];
                parent[ acc[i][j] ] = acc[i][j];
                // acc_union[ acc[i][0] ].insert(acc[i][j])
            }
        }
        
        for (int i = 0; i < acc.size(); i++) {
            string p = find_parent(acc[i][1], parent);
            // acc_union[ own[p] ].insert( acc[i][1] );
            for (int j = 2; j < acc[i].size(); j++) {
                parent[ find_parent(acc[i][j], parent) ] = p;
                // acc_union[ own[p] ].insert( acc[i][j] );
            }
        }
        
        for (int i = 0; i < acc.size(); i++) {
            for (int j = 1; j < acc[i].size(); j++) {
                acc_union[ find_parent(acc[i][j], parent) ].insert(acc[i][j]);
                // acc_union[ own[p] ].insert( acc[i][j] );
            }
        }
        
        vector< vector<string> > ans;
        for (pair<string, set<string>> v : acc_union) {
            vector<string> one(v.second.begin(), v.second.end() );
            one.insert(one.begin(), own[v.first]);
            ans.push_back(one);
        }
        
        return ans;
    }
    
    string find_parent(string v,  unordered_map<string, string>& parent) {
        return parent[v] == v ? v : find_parent( parent[v], parent );
    }
    
};