"""
# Definition for a Node.
class Node:
def __init__(self, val, neighbors):
self.val = val
self.neighbors = neighbors
"""
class Solution:
def cloneGraph(self, node: 'Node') -> 'Node':
res=Node(node.val,[])
q=[node]
visited={node:res}
while(len(q)):
t=q.pop(0)
t1=visited[t]
for n in t.neighbors:
if n not in visited:
nn=Node(n.val,[])
q.append(n)
visited[n]=nn
else:
nn=visited[n]
t1.neighbors.append(nn)
return res
leetcode133. Clone Graph
最新推荐文章于 2021-05-14 10:42:19 发布