LeetCode133.Clone Graph

题目

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 #.

  1. First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
  2. Second node is labeled as 1. Connect node 1 to node 2.
  3. 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:

   1
  / \
 /   \
0 --- 2
     / \
     \_/

思路

  1. 创建一个图副本肯定要遍历原图,可用BFS或DFS

  2. 遍历到一个节点A时,我们需要往A的副本A*中添加A的相邻节点B C D的副本B* C* D*

    • 如果A是第一次被遍历,我们可以直接创建其副本
    • 如果A是被多次遍历时,我们需要找到其之前被创建的副本

    因此,我采用一个map<原节点,该节点副本>来记录所有创建出来的节点副本,这样上面第2步操作起来就方便很多了。

代码

/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector<UndirectedGraphNode *> neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {

        unordered_map<UndirectedGraphNode *, UndirectedGraphNode *> nodeMap;

        UndirectedGraphNode * clone;

        queue<UndirectedGraphNode *> queue;

        if(node) {
            clone = new UndirectedGraphNode(node->label);
            nodeMap[node] = clone;
            queue.push(node);
        }
        else return nullptr;

        //采用BFS
        while(!queue.empty()) {
            UndirectedGraphNode * curr = queue.front();
            vector<UndirectedGraphNode *> currNgbs = curr->neighbors;
            queue.pop();

            for(int i = 0; i < currNgbs.size(); i++) {
                //在map找不到该节点,需要创建其副本,并且没有副本说明它之前还没被访问,也需要加进queue继续BFS
                if(nodeMap.find(currNgbs[i]) == nodeMap.end()) {
                    nodeMap[currNgbs[i]] = new UndirectedGraphNode(currNgbs[i]->label);
                    queue.push(currNgbs[i]);
                }
                (nodeMap[curr]->neighbors).push_back(nodeMap[currNgbs[i]]);
            }
        }

        return clone;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值