C++ Program For Cloning A Linked List With Next And Random Pointer- Set 2

We have already discussed 2 different ways to clone a linked list. In this post, one more simple method to clone a linked list is discussed.

The idea is to use Hashing. Below is algorithm. 

1. Traverse the original linked list and make a copy in terms of data.
2. Make a hash map of key value pair with original linked list node and copied linked list node.
3. Traverse the original linked list again and using the hash map adjust the next and random reference of cloned linked list nodes.

Below is the implementation of above approach.

C++

// C++ program to clone a linked list
// with random pointers
#include<bits/stdc++.h>
using namespace std;

// Linked List Node
class Node
{
    public:

    // Node data
    int data;

    // Next and random reference
    Node *next, *random;

    Node(int data)
    {
        this->data = data;
        this->next =
        this->random = NULL;
    }
};

// Linked list class
class LinkedList
{
    public:

    // Linked list head reference
    Node *head;

    LinkedList(Node *head)
    {
        this->head = head;
    }

    // Push method to put data always at
    // the head in the linked list.
    void push(int data)
    {
        Node *node = new Node(data);
        node->next = head;
        head = node;
    }

    // Method to print the list.
    void print()
    {
        Node *temp = head;
        while (temp != NULL)
        {
            Node *random = temp->random;
            int randomData = ((random != NULL) ?
                               random->data : -1);
            cout << "Data = " <<
                    temp->data << ", ";
            cout << "Random Data = " <<
                     randomData << endl;
            temp = temp->next;
        }
        cout << endl;
    }

    // Actual clone method which returns
    // head reference of cloned linked
    // list.
    LinkedList* clone()
    {
        // Initialize two references,
        // one with original list's head.
        Node *origCurr = head;
        Node *cloneCurr = NULL;

        // Hash map which contains node
        // to node mapping of original
        // and clone linked list.
        unordered_map<Node*, Node*> mymap;

        // Traverse the original list and
        // make a copy of that in the
        // clone linked list.
        while (origCurr != NULL)
        {
            cloneCurr = new Node(origCurr->data);
            mymap[origCurr] = cloneCurr;
            origCurr = origCurr->next;
        }

        // Adjusting the original list
        // reference again.
        origCurr = head;

        // Traversal of original list again
        // to adjust the next and random
        // references of clone list using
        // hash map.
        while (origCurr != NULL)
        {
            cloneCurr = mymap[origCurr];
            cloneCurr->next =
            mymap[origCurr->next];
            cloneCurr->random =
            mymap[origCurr->random];
            origCurr = origCurr->next;
        }

        // return the head reference of
        // the clone list.
        return new LinkedList(mymap[head]);
    }
};

// Driver code
int main()
{
    // Pushing data in the linked list.
    LinkedList *mylist =
                new LinkedList(new Node(5));
    mylist->push(4);
    mylist->push(3);
    mylist->push(2);
    mylist->push(1);

    // Setting up random references.
    mylist->head->random =
    mylist->head->next->next;

    mylist->head->next->random =
    mylist->head->next->next->next;

    mylist->head->next->next->random =
    mylist->head->next->next->next->next;

    mylist->head->next->next->next->random =
    mylist->head->next->next->next->next->next;

    mylist->head->next->next->next->next->random =
    mylist->head->next;

    // Making a clone of the original
    // linked list.
    LinkedList *clone = mylist->clone();

    // Print the original and cloned
    // linked list.
    cout << "Original linked list";
    mylist->print();
    cout << "Cloned linked list";
    clone->print();
}
// This code is contributed by Chhavi

Output:

Original linked list
Data = 1, Random data = 3
Data = 2, Random data = 4
Data = 3, Random data = 5
Data = 4, Random data = -1
Data = 5, Random data = 2

Cloned linked list
Data = 1, Random data = 3
Data = 2, Random data = 4
Data = 3, Random data = 5
Data = 4, Random data = -1
Data = 5, Random data = 2

Time complexity: O(n) 
Auxiliary space: O(n)
Please refer complete article on Clone a linked list with next and random pointer | Set 2 for more details!