Leetcode 题解系列（五）

最新推荐文章于 2024-07-21 08:37:44 发布

hsu_chan

最新推荐文章于 2024-07-21 08:37:44 发布

阅读量178

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/hsu_chan/article/details/78245741

版权

leetcode 专栏收录该内容

20 篇文章 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.

题目分析

1. 暴力解法

判断一个图是否为无环图，可以使用DFS进行遍历。如果遍历过程中遇到已遍历节点，则无向图有环。

2. 使用并查集

使用并查集，可以使得图连通问题的复杂度变为 $O(1)$ 。
并查集中，有相同父节点的节点，都是想连通的。如果新增了一条边，那么就判断两个端点的祖先，如果是连通的，那么说明该边是多余的边。如果不是，那么把这两个端点连接起来。

template <typename T, std::size_t N, std::size_t ...I>
constexpr auto create_array_impl(index_sequence<I...>) {
  return array<T, N>{I...};
}
template <typename T, std::size_t N>
constexpr auto create_array() {
  return create_array_impl<T, N>(make_index_sequence<N>{});
}
class Solution {
  array<int, 1001> m_disjoin;
 public:
  Solution(): m_disjoin(create_array<int, 1001>()) {}
  vector<int> findRedundantConnection(vector<vector<int>>& edges) {
    for (const auto& edge : edges) {
      if (find(edge[0]) == find(edge[1])) return edge;
      m_disjoin[find(edge[0])] = find(edge[1]);
    }
    throw exception();
  }
  int find(int node) {
    return (m_disjoin[node] == node) ? node : (m_disjoin[node] = find(m_disjoin[node]));
  }
};