133. Clone Graph Leetcode Python

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.

There are two solutions for this problem both based on BFS

one iterative another recursive.

The time complexity if O(V+E) and space is the same.

we need to maintain the que.

1. Recursive:

# Definition for a undirected graph node
# class UndirectedGraphNode:
#     def __init__(self, x):
#         self.label = x
#         self.neighbors = []

class Solution:
    # @param node, a undirected graph node
    # @return a undirected graph node
    def __init__(self):
        self.dict={None:None}
    def cloneGraph(self, node):
        if node==None:
            return None
        head=UndirectedGraphNode(node.label)
        self.dict[node]=head
        for n in node.neighbors:
            if n in self.dict:
                head.neighbors.append(self.dict[n])
            else:
                neigh=self.cloneGraph(n)
                head.neighbors.append(neigh)
        return head
        

For iterative solution.

It looks more intuitive.

# Definition for a undirected graph node
# class UndirectedGraphNode:
#     def __init__(self, x):
#         self.label = x
#         self.neighbors = []

class Solution:
    # @param node, a undirected graph node
    # @return a undirected graph node
    def cloneGraph(self, node):
        if node==None:
            return node
        que=[node]
        head=UndirectedGraphNode(node.label)
        dict={node:head}
        while que:
            curr=que.pop(0)
            for n in curr.neighbors:
                if n in dict:
                    dict[curr].neighbors.append(dict[n])
                else:
                    que.append(n)
                    copy=UndirectedGraphNode(n.label)
                    dict[n]=copy
                    dict[curr].neighbors.append(copy)
        return head
                
时间: 2024-10-10 15:37:47

133. Clone Graph Leetcode Python的相关文章

【leetcode】Clone Graph(python)

类似于二叉树的三种遍历,我们可以基于遍历的模板做很多额外的事情,图的两种遍历,深度和广度模板同样也可以做很多额外的事情,这里举例利用深度优先遍历的模板来进行复制,深度优先中,我们先访问第一个结点,接着访问第一个邻接点,再访问邻节点的邻节点.... class Solution: # @param node, a undirected graph node # @return a undirected graph node def cloneGraph(self, node): if None =

133. Clone Graph 138. Copy List with Random Pointer 拷贝图和链表

133. 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 lab

Clone Graph leetcode java(DFS and BFS 基础)

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

133. Clone Graph (3 solutions)——无向无环图复制

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 an

leetcode 133. Clone Graph ----- java

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 neigh

Java for LeetCode 133 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 neighb

Leetcode#133 Clone Graph

原题地址 方法I,DFS 一边遍历一边复制 借助辅助map保存已经复制好了的节点 对于原图中每个节点,如果已经复制过了,直接返回新节点的地址,如果没复制过,则复制并加入map中,接着依次递归复制其兄弟. 代码: 1 map<UndirectedGraphNode *, UndirectedGraphNode *> old2new; 2 3 UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) { 4 if (!node) 5 re

133. 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 n

Clone Graph -- leetcode

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 neigh