LeetCode 684. Redundant Connection

In this problem, a tree is an undirected graph that is connected and has no cycles.

The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, ..., N), with one additional 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] with u < v, that represents an undirected edge connecting nodes u and v.

Return an edge that can be removed so that the resulting graph is a tree of N nodes. If there are multiple answers, return the answer that occurs last in the given 2D-array. The answer edge [u, v] should be in the same format, with u < v.

Example 1:

Input: [[1,2], [1,3], [2,3]]
Output: [2,3]
Explanation: The given undirected graph will be like this:
  1
 / \
2 - 3

 

Example 2:

Input: [[1,2], [2,3], [3,4], [1,4], [1,5]]
Output: [1,4]
Explanation: The given undirected graph will be like this:
5 - 1 - 2
    |   |
    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.

 

 

Update (2017-09-26):
We have overhauled the problem description + test cases and specified clearly the graph is an undirected graph. For the directed graph follow up please see Redundant Connection II). We apologize for any inconvenience caused.

使用union find解决

class Solution {
    
    public int[] findRedundantConnection(int[][] edges) {
        UnionFind unionFind = new UnionFind(edges.length);
        for(int[] edge : edges){
            int start = edge[0];
            int end = edge[1];
            if(!unionFind.union(start,end)){
                return edge;
            }
        }
        return new int[2];
    }
    
    class UnionFind{
        int[] parent;
        int[] size;
        UnionFind(int n){
            
            parent = new int[n+1];
            size = new int[n+1];
            
            for(int i = 1;i<=n;i++){
                parent[i] = i;
                size[i] = 1;
            }
        }
        
        private int find(int a){//找到所在set的根节点
            if(parent[a]==a) return a;
            parent[a] = find(parent[a]);//路径压缩
            return parent[a];
        }
        
        public boolean union(int a,int b){
            int root_a = find(a);
            int root_b = find(b);
            if(root_a==root_b) return false;
            if(size[root_a]<size[root_b]){//把小的set挂载到大的set上面去
                parent[root_a] = root_b;//挂载到根节点
                size[root_b] += size[root_a];
            }
            else{
                parent[root_b] = root_a;
                size[root_a] += size[root_b];
            }
            return true;
        }
        
        
    }
    
}