LeetCode 684. Redundant Connection - 彻底掌握并查集（Union Find）系列题14

CP Coding

于 2021-12-02 06:14:25 发布

阅读量388

点赞数 1

分类专栏： Leetcode刷题笔记并查集Union Find 文章标签： python leetcode 数据结构数组

本文链接：https://blog.youkuaiyun.com/hgq522/article/details/121668799

版权

本题考察的是图的连接性和并查集(Union Find)的应用。给定一个初始为树的无向图，由于添加了一条额外的边，导致图中可能存在环。你需要找出并返回这条可移除的多余边，以恢复成一棵树。题目要求返回最后出现的多余边。算法实现包括初始化并查集，遍历边数组并合并顶点，如果发现顶点已在同一集合，则找到冗余边。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

You are given a graph that started as a tree with n nodes labeled from 1 to 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 graph is represented as an array edges of length n where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the graph.

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 input.

Example 1:

最低0.47元/天解锁文章