leetcode 日经贴，Cpp code -Clone Graph

bachelorchen

于 2015-04-24 13:55:38 发布

阅读量377

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 Cpp leetcode

本文链接：https://blog.youkuaiyun.com/bachelorchen/article/details/45245643

算法同时被 3 个专栏收录

183 篇文章

订阅专栏

leetcode

173 篇文章

订阅专栏

Cpp

152 篇文章

订阅专栏

本文深入探讨了无向图的克隆算法实现，包括使用哈希映射和队列进行图节点复制及边复制的过程，确保了图结构的完整复制。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Clone Graph

/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector<UndirectedGraphNode *> neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if (!node) {
            return NULL;
        }
        map<UndirectedGraphNode*, UndirectedGraphNode*> mp;
        queue<UndirectedGraphNode*> q;
        mp[node] = new UndirectedGraphNode(node->label);
        q.push(node);
        while (!q.empty()) {
            UndirectedGraphNode *cp = q.front();
            UndirectedGraphNode *np = mp[cp];
            q.pop();
            for (int i = 0; i < cp->neighbors.size(); ++i) {
                UndirectedGraphNode *tp = cp->neighbors[i];
                if (mp.find(tp) == mp.end()) {
                    mp[tp] = new UndirectedGraphNode(tp->label);
                    q.push(tp);
                }
                np->neighbors.push_back(mp[tp]);
            }
        }
        return mp[node];
    }
};