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.

思路:一棵树内的任意两个节点相连就构成了环,记录每个节点的所在树的根节点,如果遍历到一条边两个节点的根节点均相同那么这条边就为构成环的一边。利用了并查集的路径压缩来解决问题。关于并查集，有一篇文章可以去了解一下并查集。

public class Redundant_Connection {
	public static int[] findRedundantConnection(int[][] edges) 
	{
		if(edges.length==0||edges==null)
			return null;
		int result[] = new int[2];
		int root[] = new int[edges.length*2];
		for(int i=0;i<edges.length*2;i++)
			root[i] = i+1;
		for(int i=0;i<edges.length;i++)
		{
			int edge[] = edges[i];
			if(root[edge[0]-1]==root[edge[1]-1])
			{
				result[0] = edge[0];
				result[1] = edge[1];
				continue;
			}
			int original = root[edge[1]-1];
			root[edge[1]-1] = root[edge[0]-1];
			//将原来根节点为root[edge[1]-1]的全部改为root[edge[0]-1]
			for(int j=0;j<root.length;j++)
			{
				if(root[j]==original)
					root[j] = root[edge[0]-1];;										
			}						
//			System.out.println(Arrays.toString(root));
		}
//		System.out.println(Arrays.toString(result));
		return result;        
    }
	public static void main(String[] args) {
		int[][] edges = {{1,2}, {2,3}, {3,4}, {1,4}, {1,5}};
		int result[] = findRedundantConnection(edges);
		for(int i=0;i<result.length;i++)
			System.out.println(result[i]);
	}
}