lintcode:Graph Valid Tree

最新推荐文章于 2021-01-19 14:07:14 发布

martin_liang

最新推荐文章于 2021-01-19 14:07:14 发布

阅读量413

点赞数

分类专栏：算法 C++/C leetcode

本文链接：https://blog.csdn.net/martin_liang/article/details/50978363

版权

算法同时被 3 个专栏收录

537 篇文章 1 订阅

订阅专栏

C++/C

504 篇文章 0 订阅

订阅专栏

leetcode

230 篇文章 0 订阅

订阅专栏

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.

Have you met this question in a real interview?

Yes

Notice

You can assume that no duplicate edges will appear in edges. Since all edges areundirected, [0, 1] is the same as [1, 0] and thus will not appear together in edges.

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.

class Solution {
    
private:
    bool validTreeDFS(vector<vector<int>>& auxVtr, int curIdx, int preIdx, vector<int>& visited) {
   
        if (visited[curIdx])
            return false;
   
        vector<int> curVtr = auxVtr[curIdx];
        visited[curIdx] = 1;
   
        for (int i=0; i<curVtr.size(); i++)
        {
            if (curVtr[i] != preIdx) //这里避免循环计算
            {
                if (!validTreeDFS(auxVtr, curVtr[i], curIdx, visited))
                    return false;
            }
        }
   
        return true;
    }
    
public:
    /**
     * @param n an integer
     * @param edges a list of undirected edges
     * @return true if it's a valid tree, or false
     */
    bool validTree(int n, vector<vector<int>>& edges) {
        // Write your code here
        
        vector<vector<int>> auxVtr(n);
   
        for (int i=0; i<edges.size(); i++)
        {
            auxVtr[edges[i][0]].push_back(edges[i][1]);
            auxVtr[edges[i][1]].push_back(edges[i][0]);
        }
   
        vector<int> visited(n, 0);
        if (!validTreeDFS(auxVtr, 0, -1, visited))
            return false;
   
        for (int i=0; i<n; i++) //这里确保没有孤岛，就是每一个数都已经visit过
        {
            if (!visited[i])
                return false;
        }
   
        return true;
    }
};