138. Copy List with Random Pointer

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Return a deep copy of the list.

 

Example 1:

Input:
{"$id":"1","next":{"$id":"2","next":null,"random":{"$ref":"2"},"val":2},"random":{"$ref":"2"},"val":1}

Explanation:
Node 1's value is 1, both of its next and random pointer points to Node 2.
Node 2's value is 2, its next pointer points to null and its random pointer points to itself.

 

Note:

1. You must return the copy of the given head as a reference to the cloned list.

   #include <iostream>
   #include <unordered_map>
   
   using namespace std;
   
   class Node {
   public:
       int val;
       Node* next;
       Node* random;
   
       Node() {}
   
       Node(int _val, Node* _next, Node* _random) {
           val = _val;
           next = _next;
           random = _random;
       }
   };
   unordered_map<Node*, Node*> mp;
   Node* copyRandomList(Node* head) {
       if(!head)
           return NULL;
       if(!mp.count(head)){
           //not copy
           mp[head] = new Node(head->val, NULL, NULL);
           if(!mp.count(head->next)){
               mp[head]->next = copyRandomList(head->next);
           }
           else {
               mp[head]->next = mp[head->next];
           }
           if(!mp.count(head->random)){
               mp[head]->random = copyRandomList(head->random);
           }
           else {
               mp[head]->random = mp[head->random];
           }
       }
       return mp[head];
   }