leetcode 133. 克隆图

发表于 | 分类于

题目链接：leetcode

思路：
bfs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
from collections import deque
class Solution:
    # @param node, a undirected graph node
    # @return a undirected graph node
    def cloneGraph(self, node):
        if node == None:
            return 
        root = UndirectedGraphNode(node.label)
        q = deque([(node, root)]) # node to complete neighbors       
        visited = set()
        while q:
            n, tobe = q.popleft()                        
            visited.add(n)
            for neighbor in n.neighbors:
                neighbor_tobe = UndirectedGraphNode(neighbor.label)
                tobe.neighbors.append(neighbor_tobe)
                if neighbor not in visited:
                    q.append((neighbor, neighbor_tobe))
        return root