克隆无向图算法详解-CSDN博客

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:

Have you been asked this question in an intervie

使用map存label和新建的节点，利用queue做广度优先遍历，第一次遍历把该建的节点都建了

第二次遍历的时候复制neighbors的关系

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