题目链接:https://leetcode.com/problems/graph-valid-tree/
Given n
nodes labeled from 0
to n - 1
and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.
For example:
Given n = 5
and edges = [[0, 1], [0, 2], [0, 3], [1, 4]]
, return true
.
Given n = 5
and edges = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]]
, return false
.
Hint:
- Given
n = 5
andedges = [[0, 1], [1, 2], [3, 4]]
, what should your return? Is this case a valid tree? - According to the definition of tree on Wikipedia: “a tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.”
Note: you can assume that no duplicate edges will appear in edges
. Since all edges are undirected, [0, 1]
is the same as [1, 0]
and thus will not appear together in edges
.
思路:判断一个图是不是一棵树①首先应该有n-1条边 ②边没有形成环
初始端点n个是独立的, 并且每个端点的父结点为自身索引. 利用并查集, 如果一条边的两个端点的最终父结点不相同, 那么两个端点就可以合并到一个集合中. 最后看是否只有一个集合即可.
代码如下:
class Solution {
public:
bool validTree(int n, vector<pair<int, int>>& edges) {
if(n != edges.size()+1) return false;
vector<int> par(n);
for(int i = 0; i < n; i++) par[i] = i;
for(auto val: edges)
{
int par1 = val.first, par2 = val.second;
while(par[par1] != par1) par1 = par[par1];
while(par[par2] != par2) par2 = par[par2];
if(par1 != par2) par[par2] = par1, n--;
}
return n==1;
}
};