import scala.collection.mutable

import scala.collection.mutable.HashMap

​

object Main { // Visited hashmap

  class Node(var prod:Int, var next:Node = null, var related:Node=null) {

  }

  var visited = new mutable.HashMap[Node, Node]()

​

  def copyProductRelations(head: Node): Node = {

    if (head == null)

      return null

    var oldNode = head

    // Creating the new head node.

    var newNode = new Node(oldNode.prod)

    visited.put(oldNode, newNode)

    // Iterate on the linked list until all nodes are cloned.

    while ( {

      oldNode != null

    }) { // Get the clones of the nodes referenced by related and next pointers.

      newNode.related = getClonedNode(oldNode.related)

      newNode.next = getClonedNode(oldNode.next)

      oldNode = oldNode.next

      newNode = newNode.next

    }

    visited(head)

  }

​

  def getClonedNode(node: Node): Node = {

    if (node != null) if (visited.contains(node)) { // If its in the visited hashmap then return the new node reference from the hashmap

      return visited(node)

    }

    else { // Otherwise create a new node, add to the hashmap and return it

      visited.put(node, new Node(node.prod, null, null))

      return visited(node)

    }

    null

  }

​

  def printList(products:Node):Unit={

    var pro:Node = products

    while(pro != null){

      print("(prod=")

      print(pro.prod )

      if(pro.related==null){

        print(", related="+ -1)

      }

      else

      {

        print(", related="+ pro.related.prod)

      }

      print(")")

      pro = pro.next

      if(pro!=null)

        print(" => ")

    }

    println()

  }

​

  def createList(values:Array[Int], pointers:Array[Int]):Node={

    var head:Node = new Node(values(0))

    var iter = head

    var i =1

    while(i<values.size) {

      iter.next = new Node(values(i))

      iter = iter.next

      i += 1

    }

    iter = head

    i = 0

    while(i<pointers.size){

      if(pointers(i) != -1) {

        val related = pointers(i)

        var j = 0

        var aux = head

        while(j<related){

          aux = aux.next

          j += 1

        }

        iter.related = aux

      }

      iter = iter.next

      i += 1

    }

​

​

    return head

  }

​