[leetcode 133]Clone Graph

最新推荐文章于 2024-09-18 15:03:01 发布

「已注销」

最新推荐文章于 2024-09-18 15:03:01 发布

阅读量197

点赞数

分类专栏： [LeetCode 刷题] 文章标签： leetcode BFS

本文链接：https://blog.csdn.net/xinxinxv/article/details/42215163

版权

[LeetCode 刷题] 专栏收录该内容

158 篇文章 0 订阅

订阅专栏

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

OJ's undirected graph serialization:

Nodes are labeled uniquely.

We use # as a separator for each node, and , as a separator for node label and each neighbor of the node.

As an example, consider the serialized graph {0,1,2#1,2#2,2}.

The graph has a total of three nodes, and therefore contains three parts as separated by #.

First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
Second node is labeled as 1. Connect node 1 to node 2.
Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle.

Visually, the graph looks like the following:

/**
 * 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 == NULL) {
            return NULL;
        }
        map<int, UndirectedGraphNode *> nodes;
        queue<UndirectedGraphNode*> q;
        q.push(node);
        while (!q.empty()) {
            UndirectedGraphNode *tmp = q.front();
            q.pop();
            if (nodes.find(tmp->label) == nodes.end()) {
                UndirectedGraphNode *newNode = new UndirectedGraphNode(tmp->label);
                nodes.insert(pair<int,UndirectedGraphNode*>(tmp->label,newNode));
                for (auto i = 0; i < tmp->neighbors.size(); i++) {
                    q.push(tmp->neighbors[i]);
                }
            }
        }
        q.push(node);
        while(!q.empty()) {
            UndirectedGraphNode* tmp = q.front();
            q.pop();
            UndirectedGraphNode* tmp2 = nodes[tmp->label];
            if  (tmp2->neighbors.empty() && !tmp->neighbors.empty()) {
                for (auto i = 0; i < tmp->neighbors.size(); i ++) {
                    tmp2->neighbors.push_back(nodes[tmp->neighbors[i]->label]);
                    q.push(tmp->neighbors[i]);
                }
            }
        }
        return nodes[node->label];
        
    }
};