lintcode-medium-Clone Graph

最新推荐文章于 2024-01-31 02:06:37 发布

weixin_30885111

最新推荐文章于 2024-01-31 02:06:37 发布

阅读量125

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/goblinengineer/p/5279110.html

本文介绍了一种使用BFS算法复制无向图的方法，包括新建节点并建立映射关系，最终填充邻居节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

思路：

分为两步

1. BFS，新建所有图中的node，用一个HashMap建立原来node和新的node之间的对应关系

2. 再遍历所有原有的node，把新node中的neighbors填上对应的node

/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     ArrayList<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */
public class Solution {
    /**
     * @param node: A undirected graph node
     * @return: A undirected graph node
     */
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        // write your code here
        
        if(node == null)
            return null;
        
        ArrayList<UndirectedGraphNode> nodes = new ArrayList<UndirectedGraphNode>();
        HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
        
        nodes.add(node);
        map.put(node, new UndirectedGraphNode(node.label));
        
        int start = 0;
        while(start < nodes.size()){
            UndirectedGraphNode temp = nodes.get(start++);
            for(int i = 0; i < temp.neighbors.size(); i++){
                UndirectedGraphNode neighbor = temp.neighbors.get(i);
                if(!map.containsKey(neighbor)){
                    nodes.add(neighbor);
                    map.put(neighbor, new UndirectedGraphNode(neighbor.label));
                }
            }
        }
        
        for(int i = 0; i < nodes.size(); i++){
            UndirectedGraphNode temp = nodes.get(i);
            
            for(int j = 0; j < temp.neighbors.size(); j++){
                map.get(temp).neighbors.add(map.get(temp.neighbors.get(j)));
            }
        }
        
        return map.get(node);
    }
}