Clone Graph [leetcode] dfs和bfs
来源:互联网 发布:淘宝男装店铺名字 编辑:程序博客网 时间:2024/05/29 17:31
变量unordered_map<UndirectedGraphNode *, UndirectedGraphNode *> cloneMap;
因为会有环,所以需要cloneMap记录旧的节点和新的节点对。
还需要一个visited记录已经访问过的节点,可以和cloneMap合并在一起。
DFS:
在克隆某个Node时,首先放入map中。
之后遍历neighbors。如果neighbors不在map里,即没有访问过,则递归调用cloneGraph函数。
最后返回克隆过的节点。
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) { if (node == NULL) return NULL; if (cloneMap.find(node) != cloneMap.end()) return cloneMap[node]; cloneMap[node] = new UndirectedGraphNode(node->label); cloneMap[node]->neighbors = vector<UndirectedGraphNode *>(); for (int i = 0; i < node->neighbors.size(); i++) { UndirectedGraphNode * curNode = node->neighbors[i]; UndirectedGraphNode * newNode = cloneGraph(curNode); cloneMap[node]->neighbors.push_back(newNode); } return cloneMap[node]; }
BFS:
使用一个queue记录要访问的节点。
因为不能在访问queue中节点的时候再创建对应的node==>因为在处理父亲节点的时候需同时创建好其neighbors
所以需要在将不在map中的neighbors(没有访问过的子节点)放入queue的同时创建克隆的节点,并且放入map里。
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) { if (node == NULL) return NULL; vector<UndirectedGraphNode *> queue; queue.push_back(node); cloneMap[node] = new UndirectedGraphNode(node->label); cloneMap[node]->neighbors = vector<UndirectedGraphNode *>(); for (int i = 0; i < queue.size(); i++) { UndirectedGraphNode * newNode = cloneMap[queue[i]]; for (int j = 0; j < queue[i]->neighbors.size(); j++) { UndirectedGraphNode * curNb = queue[i]->neighbors[j]; if (cloneMap.find(curNb) == cloneMap.end()) { queue.push_back(curNb); UndirectedGraphNode * newNb = new UndirectedGraphNode(curNb->label); newNb->neighbors = vector<UndirectedGraphNode *>(); cloneMap[curNb] = newNb; } newNode->neighbors.push_back(cloneMap[curNb]); } } return cloneMap[node]; }
0 0
- Clone Graph [leetcode] dfs和bfs
- [LeetCode] Clone Graph(!!!!graph&dfs&bfs)
- LeetCode 133 Clone Graph (BFS || DFS)
- Clone Graph BFS & DFS
- BFS和DFS解决LeetCode133. Clone Graph
- leetcode -- Clone Graph -- deep copy问题,dfs,bfs
- Leetcode 133. Clone Graph用BFS、DFS两种解法
- [leetcode] 133 clone graph bfs
- Clone Graph DFS&BFS 图的复制
- [C++]LeetCode: 129 Clone Graph (图的深拷贝 BFS && DFS)
- LeetCode[Graph]: Clone Graph
- Clone Graph,bfs,map
- Clone Graph BFS
- leetcode 133. Clone Graph 图遍历BFS + 避免循环
- [LeetCode] CLone Graph
- LeetCode:Clone Graph
- [leetcode]Clone Graph
- Leetcode: Clone Graph
- 本地socket unix domain socket
- 树状数组原理解析
- 我的第一个socket
- Git clone 时 SSL certificate 错误
- Android中AsyncTask的使用与源码分析
- Clone Graph [leetcode] dfs和bfs
- C++总结
- 软考-系统开发与软件工程
- DSP学习总结——McBSP
- Base64加密与解密
- 【BZOJ】1061 [Noi2008]志愿者招募 最小费用最大流——预流&填坑
- C++抛出异常exception
- 配置TOMCAT----- 修改默认ROOT路径
- C list 函数介绍