685. Redundant Connection II

Description

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.

Problem URL

---

Solution

给一个图，有N个节点，这次是有向图，labeled from 1 to N。本来是一棵树，但是现在多了一条边，找到多的这条边。

Code

class Solution {
    public int[] findRedundantDirectedConnection(int[][] edges) {
        int[] parents = new int[edges.length + 1];
        for (int i = 0; i <= edges.length; i++){
            parents[i] = i;
        }
        
        int[] candidate1 = null, candidate2 = null;
        for (int[] edge : edges){
            int parentx = find(parents, edge[0]), parenty = find(parents, edge[1]);
            if (parentx != parenty){
                if (parenty != edge[1]){
                    candidate1 = edge;// record the last edge which results in "multiple parents
                }
                else{
                    parents[parenty] = parentx;
                }
            }
            else{
                candidate2 = edge;// record last edge which results in "cycle" issue, if any.
            }
        }
        
        if (candidate1 == null){
            return candidate2;
        }
        if (candidate2 == null){
            return candidate1;
        }
        // If both issues present, then the answer should be the first edge which results in "multiple parents" issue
        for (int[] edge : edges){
            if (edge[1] == candidate1[1]){
                return edge;
            }
        }
        return new int[2];
    }
    
    private int find(int[] parents, int n){
        while (n != parents[n]){
            parents[n] = parents[parents[n]];
            n = parents[n];
        }
        return n;
    }
}

Time Complexity: O(n)
Space Complexity: O(n)

---

Review