golang力扣leetcode 133.克隆图

package main
type Node struct {
  Val       int
  Neighbors []*Node
}
func cloneGraph(node *Node) *Node {
  visited := make(map[*Node]*Node)
  return dfsClone(node, visited)
}
func dfsClone(node *Node, visited map[*Node]*Node) *Node {
  if node == nil {
    return nil
  }
  if val, ok := visited[node]; ok {
    return val
  }
  cloneNode := &Node{
    Val:       node.Val,
    Neighbors: make([]*Node, len(node.Neighbors)),
  }
  visited[node] = cloneNode
  for i := 0; i < len(node.Neighbors); i++ {
    cloneNode.Neighbors[i] = dfsClone(node.Neighbors[i], visited)
  }
  return cloneNode
}
func main() {
}