261. Graph Valid Tree
Posted jxr041100
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了261. 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
.
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
.
class Solution { public: bool validTree(int n, vector<pair<int, int>>& edges) { vector<int>roots(n,-1); for(auto edge:edges) { int x = findroots(roots,edge.first),y = findroots(roots,edge.second); if(x==y) return false; roots[x] = y; } return edges.size()==n-1; } private: int findroots(vector<int> &roots,int x) { while(roots[x]!=-1) x = roots[x]; return x; } };
以上是关于261. Graph Valid Tree的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode 261: Graph Valid Tree
Leetcode 261: Graph Valid Tree
LeetCode 261. Graph Valid Tree(判断图是否为树)