leetcode-133-克隆图

题目描述：

 

方法一：dfs+hashmap

"""
# 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':
        dic = {}
        def dfs(node):
            if node not in dic:
                dic[node] = Node(node.val,[])
                for i in node.neighbors:
                    dic[node].neighbors.append(dfs(i))
            return dic[node]
        dfs(node)
        return dic[node]
        
            

 方法二：

class Solution:
    def cloneGraph(self, node: 'Node') -> 'Node':
        return copy.deepcopy(node)

 

转载于:https://www.cnblogs.com/oldby/p/11194745.html