首页 > 其他 > 详细

133. Clone Graph

时间:2018-05-20 15:56:43      阅读:106      评论:0      收藏:0      [点我收藏+]
/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector<UndirectedGraphNode *> neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    unordered_map<UndirectedGraphNode *,UndirectedGraphNode *> m;
    unordered_set<UndirectedGraphNode *> visited;
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if (node == NULL)   return NULL;
        dfs_create(node);
        dfs_link(node);
        return m[node];
    }
    void dfs_create(UndirectedGraphNode *node) {
        if (node == NULL || m.count(node))   return;
        UndirectedGraphNode *p = new UndirectedGraphNode(node->label);
        m[node] = p;
        for (auto n : node->neighbors)
            dfs_create(n);
    }
    void dfs_link(UndirectedGraphNode *node) {
        if (node == NULL || visited.count(node))   return;
        visited.insert(node);
        for (auto n : node->neighbors) {
            m[node]->neighbors.push_back(m[n]);
            dfs_link(n);
        }
    }
};

 

133. Clone Graph

原文:https://www.cnblogs.com/JTechRoad/p/9063544.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!