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:

1. The size of the input 2D-array will be between 3 and 1000.
2. 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.

方法1:

思路：

找到第一次（这里也是最后一次unionhelper返回false的那条边）。

Complexity

Time complexity: O(E + V), with path compression
Space complexity: O(V)

class Solution {
public:
    vector<int> findRedundantConnection(vector<vector<int>>& edges) {
        int n = edges.size();
        vector<int> res;
        vector<int> root(n, 0);
        vector<int> size(n, 1);
        for (int i = 0; i < n; i++) root[i] = i;
        for (vector<int> edge: edges) {
            int i = edge[0] - 1, j = edge[1] - 1;
            if (!unionHelper(root, size, i, j)) res = edge;
        }
        return res;
    }
    // return bool: have the union actually happened? or they or unioned already
    bool unionHelper(vector<int> & root, vector<int> & size, int i, int j) {
        int par1 = findHelper(root, i);
        int par2 = findHelper(root, j);
        if (par1 == par2) return false;
        else {
            if (size[par1] <= size[par2]) {
                root[par1] = par2;
            }
            else {
                root[par2] = par1;
            }
            size[par1] = size[par2] = size[par1] + size[par2];
            return true;
        }
    }
    int findHelper(vector<int> & root, int i) {
        while (i != root[i]) {
            root[i] = root[root[i]];
            i = root[i];
        }
        return i;
    }
};