LeetCode #685 - Redundant Connection II

题目描述：

In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, except for the root node which has no parents.

The given input is a directed graph that started as a rooted tree with N nodes (with distinct values 1, 2, ..., N), with one additional directed edge added. The added edge has two different vertices chosen from 1 to N, and was not an edge that already existed.

The resulting graph is given as a 2D-array of edges. Each element of edges is a pair [u, v] that represents a directed edge connecting nodes u and v, where u is a parent of child v.

Return an edge that can be removed so that the resulting graph is a rooted tree of N nodes. If there are multiple answers, return the answer that occurs last in the given 2D-array.

Example 1:

Input: [[1,2], [1,3], [2,3]]

Output: [2,3]

Explanation: The given directed graph will be like this:

  1

 / \

v   v

2-->3

Example 2:

Input: [[1,2], [2,3], [3,4], [4,1], [1,5]]

Output: [4,1]

Explanation: The given directed graph will be like this:

5 <- 1 -> 2

     ^    |

     |    v

     4 <- 3

Note:

The size of the input 2D-array will be between 3 and 1000.

Every integer represented in the 2D-array will be between 1 and N, where N is the size of the input array.

class Solution {
public:
    vector<int> findRedundantDirectedConnection(vector<vector<int>>& edges) {
        int n=edges.size();
        vector<int> first,second;
        unordered_map<int,int> parent;
        int i=0;
        while(i<edges.size()) //先找入度为2的节点，指向这个点的两条边必有一条边是冗余的
        {
            if(parent.count(edges[i][1])==0) 
            {
                parent[edges[i][1]]=edges[i][0];
                i++;
            }
            else 
            {
                first={parent[edges[i][1]],edges[i][1]};
                second=edges[i];
                edges.erase(edges.begin()+i); //把second删除
            }
        }
        //寻找环
        for(auto edge:edges)
        {
            parent[edge[0]]=edge[0];
            parent[edge[1]]=edge[1];
        }
        for(auto edge:edges)
        {
            int x=find(parent,edge[0]);
            int y=find(parent,edge[1]);
            //如果存在环，但是不存在入度为2的点，就直接返回构成环的边
            //如果存在环，而且存在入度为2的点（在删除了second的情况下），返回first
            if (x==y) return first.empty()?edge:first;
            parent[x]=y;
        }
        return second; //如果在删除了second的情况下，不存在环，而且不存在入度为2的点，返回second
    }
    
    int find(unordered_map<int,int> parent, int i)
    {
        if(parent[i]!=i) return find(parent,parent[i]);
        else return i;
    }
};