算法——Week 7

最新推荐文章于 2021-10-21 23:03:50 发布

!&?

最新推荐文章于 2021-10-21 23:03:50 发布

阅读量214

点赞数

分类专栏：算法分析与设计课程作业

本文链接：https://blog.csdn.net/melwx/article/details/83066504

版权

算法分析与设计课程作业专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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.

解题思路
利用一个数组，下标对应顶点的编号，值对应着与之相连的顶点。如果没有顶点与之相连，则置为0 。如果顶点已经与其他顶点相连，则通过通过数组找到这一组相连顶点中的那个度为1的点，即数值为0的点，将其数值设置为该边另一个端点的编号。
每加入一条边，都要找到最后那个度为1的点（起点和终点都要找）。如果起点和终点对应的是同一个度为1的点，那么说明加入这条边就会产生环，这条边可以去掉。否则，将起点对应的度为1的点的值设置为终点的编号。

代码如下：

class Solution {
public:
    vector<int> findRedundantConnection(vector<vector<int>>& edges) {
        vector<int> p(2000, 0);
        vector<int> result;
        for(auto v : edges) {
            int n1 = v[0];
            int n2 = v[1];
            while(p[n1] != 0) {
                n1 = p[n1];
            }
            while(p[n2] != 0) {
                n2 = p[n2];
            }
            if(n1 == n2) 
                result = v;
            else
                p[n1] = n2;
        }
        return result;
    }
};