[leetcode] 133.Clone Graph

原创 2015年07月07日 17:00:59

题目:
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:

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

题意:
克隆一棵无向树。
思路:
对于任何一个边,(i,j),i的相邻节点有j,j的相邻节点有i。由于需要复制每一个节点,所以需要new出每一个节点,但是由于任和边都会被访问两次,(i,j),(j,i),比如一开始先复制出i节点,然后需要递归复制与i相邻的节点j,复制j节点的时候需要去复制j的相邻节点,由于i节点之前已经复制过,所以此处不需要再复制i节点。我采用了unordered_map来存放已经复制的节点,由于这道题给每个节点一个标记了,所以可以完美的使用map来保存(label值,节点)这样的键值对。
采用的是深度优先算法。
详细代码请参考如下:

/**
 * 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;
        UndirectedGraphNode *root = NULL;
        cloneGraphRecur(root, node);
        return root;
    }
    void cloneGraphRecur(UndirectedGraphNode *&root, UndirectedGraphNode *&node) {
        root = new UndirectedGraphNode(node->label);
        existNodes[node->label] = root;
        for(auto neighbor:node->neighbors) {
            if(existNodes.find(neighbor->label) == existNodes.end()){
                UndirectedGraphNode *temp = NULL;
                cloneGraphRecur(temp, neighbor);
                root->neighbors.push_back(temp);
            }
            else root->neighbors.push_back(existNodes[neighbor->label]);
        }
    }
    private:
    unordered_map<int,UndirectedGraphNode*> existNodes;
};
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

算法设计Week3 LeetCode Algorithms Problem #133 Clone Graph

题目描述: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbo...

LeetCode133. Clone Graph

题目: https://leetcode.com/problems/clone-graph/ Clone an undirected graph. Each node in the graph c...

LeetCode: Clone Graph [133]

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

[leetcode] 133. Clone Graph 解题报告

题目链接:https://leetcode.com/problems/clone-graph/ Clone an undirected graph. Each node in the graph ...

LeetCode133—Clone Graph

LeetCode133—Clone Graph

LeetCode 133. Clone Graph

题目描述: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbo...

Leetcode 133. Clone Graph (Medium) (cpp)

Leetcode 133. Clone Graph (Medium) (cpp)

Leetcode 133. Clone Graph

图的广度优先遍历可以用于图的复制。

Leetcode 133. Clone Graph & 138. Copy List with Random Pointer

因为自己是先做的138,先说138。 138. Copy List with Random Pointer Total Accepted: 64859 Total Submissions:...

LeetCode——133.Clone Graph && 621.Task Scheduler

本周两道题,一道是图的题,一道是贪心的题。 Clone Graph 1.问题描述 克隆一个无向图,已知节点的形式,是一个结构体,有一个label和一个邻接表,表示所有邻居节点。节点的label值...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)