684. Redundant Connection

https://leetcode.com/problems/redundant-connection/description/

Use map to do Union Find.

class Solution {
public:
    vector<int> findRedundantConnection(vector<vector<int>>& edges) {
        unordered_map<int,int> parent;
        for (const auto& e : edges) {
            int p = findParent(parent, e[]);
            int c = findParent(parent, e[]);
            if (p == c)
                return e;
            parent[c] = p;
        }
        return vector<int>();
    }
    int findParent(unordered_map<int,int>& parents, int child) {
        while (parents.count(child))
            child = parents[child];
        return child;
    }
};