Redundant Connection问题及解法
来源:互联网 发布:淘宝小美工作室假货吗 编辑:程序博客网 时间:2024/06/05 06:23
问题描述:
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
问题分析:
这是一类查找公共头结点的问题,如果两个相连的节点有公共头结点,那么就可能存在环。这里使用并查集求解。
过程详见代码:
class Solution {public: vector<int> findRedundantConnection(vector<vector<int>>& edges) { int n = edges.size();vector<int> index(n + 1);vector<int> res(2);for (int i = 0; i <= n; i++) index[i] = i;for (auto edge : edges){int id0 = index[edge[0]];int id1 = index[edge[1]];while (id0 != index[id0]){id0 = index[id0];}while (id1 != index[id1]){id1 = index[id1];}if (id0 != id1){int id = min(id0, id1);index[id0] = id;index[id1] = id;}else res = edge;}return res; }};
- Redundant Connection问题及解法
- leetcode 684. Redundant Connection解法
- Redundant Connection
- 684. Redundant Connection
- leetcode 684. Redundant Connection
- 685. Redundant Connection II
- Redundant Connection(leetcode)
- Redundant Connection II
- 684. Redundant Connection
- 684. Redundant Connection
- Redundant Connection II
- 684. Redundant Connection
- LeetCode684 Redundant Connection
- 685. Redundant Connection II
- 【LeetCode】684. Redundant Connection
- [LeetCode]684. Redundant Connection
- 【LeetCode】Redundant Connection
- leetcode练习 Redundant Connection
- n个整数中找出连续m个数加和是最大Java版
- Windows平台vlc-qt的编译和使用
- java进阶建议读的11本书
- QGIS开发之矢量图层的使用
- wireshark抓包图解 TCP三次握手/四次挥手详解
- Redundant Connection问题及解法
- 《驾驭Core Data》 第三章 数据建模
- 111
- python3中利用serial模块实现单片机与python上位机的通信(串口调试助手)
- win10+GTX1070+1T硬盘
- 用Scheme解释器项目来了解Java(一)
- Springboot中如何引入本地jar包,并通过maven把项目成功打包成jar包部署
- flex
- 四大行、城商行等银行都在使用什么数据库?