133. Clone Graph

最新推荐文章于 2020-08-12 10:22:05 发布

lqcsp

最新推荐文章于 2020-08-12 10:22:05 发布

阅读量315

点赞数

分类专栏： c++ LeetCode 面试题图论文章标签： leetcode bfs

本文链接：https://blog.csdn.net/lqcsp/article/details/52267704

版权

c++ 同时被 3 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode 面试题

73 篇文章 1 订阅

订阅专栏

图论

10 篇文章 0 订阅

订阅专栏

#
@(leetcode)[BFS, 图论]

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(NULL == node) {
            return node;
        }
        queue<UndirectedGraphNode*> que;
        unordered_map<int, UndirectedGraphNode*> hash_map;
        que.push(node);
        //第一次BFS，将所有节点存入到map中
        while(!que.empty()) {
            UndirectedGraphNode* tmp = que.front();
            que.pop();
            if(hash_map.count(tmp->label) == 0) {
                UndirectedGraphNode* new_node = new UndirectedGraphNode(tmp->label);
                hash_map[new_node->label] = new_node;
                for(int i = 0; i < tmp->neighbors.size(); ++i) {
                    que.push(tmp->neighbors[i]);
                }
            }
        }

        //第二次BFS，复制原图的所有临接节点
        que.push(node);
        while(!que.empty()) {
            UndirectedGraphNode* tmp = que.front();
            que.pop();
            UndirectedGraphNode* exisit_node = hash_map[tmp->label];
            if(exisit_node->neighbors.empty() && !tmp->neighbors.empty()) {
                for(int i = 0; i < tmp->neighbors.size(); ++i) {
                    exisit_node->neighbors.push_back(hash_map[tmp->neighbors[i]->label]);
                    que.push(tmp->neighbors[i]);
                }
            }
        }
        return hash_map[node->label];
    }
};