美文网首页
133. Clone Graph

133. Clone Graph

作者: 7ccc099f4608 | 来源:发表于2020-03-17 13:18 被阅读0次

https://leetcode-cn.com/problems/clone-graph/

image.png

(图片来源https://leetcode-cn.com/problems/clone-graph/

日期 是否一次通过 comment
2020-03-17 0

递归

public Node cloneGraph(Node node) {
        if(node == null) {
            return node;
        }

        Map<Node, Node> nodeMap = new HashMap<>();  // 存 {旧节点:新节点}

        return clone(node, nodeMap);
    }


    private Node clone(Node node, Map<Node, Node> nodeMap) {
        if(node == null) {
            return null;
        }

        if(nodeMap.containsKey(node)) {
            return nodeMap.get(node);
        }

        Node newNode = new Node(node.val, new ArrayList<>());
        nodeMap.put(node, newNode);

        for (Node neighbor : node.neighbors) {
            newNode.neighbors.add(clone(neighbor, nodeMap));
        }


        return newNode;
    }

相关文章

  • Leetcode图

    133. 克隆图[https://leetcode-cn.com/problems/clone-graph/] 2...

  • 133. Clone Graph

    第一步加到map里面value是null只是为了去重,下一次遇到就不会进queue

  • 133. Clone Graph

  • 133. Clone Graph

    https://leetcode-cn.com/problems/clone-graph/ (图片来源https:...

  • 133. Clone Graph

    给无向连通图中节点的引用,返回图的深拷贝。 DFS 对访问过的节点进行标记,然后用dfs 时间复杂度O(n),空间...

  • Leetcode 133. Clone Graph

    题意:克隆一个无向图。 思路:因为是克隆所以需要一个map来存储克隆的映射关系,我们可以从给定的第一个节点向它的n...

  • LeetCode 133. Clone Graph

    Clone an undirected graph. Each node in the graph contain...

  • 133. Clone Graph 复制无向图

    bfs dfs

  • Clone graph

    Medium, Msc Question 复制一个无向graph。graph的每个节点包含一个label和以个ne...

  • Clone Graph

    Description Clone an undirected graph. Each node in the g...

网友评论

      本文标题:133. Clone Graph

      本文链接:https://www.haomeiwen.com/subject/fvctyhtx.html