6. Copy List With Random Pointer

Description

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

Construct a deep copy of the list. The deep copy should consist of exactly n brand new nodes, where each new node has its value set to the value of its corresponding original node. Both the next and random pointer of the new nodes should point to new nodes in the copied list such that the pointers in the original list and copied list represent the same list state. None of the pointers in the new list should point to nodes in the original list.

For example, if there are two nodes X and Y in the original list, where X.random --> Y, then for the corresponding two nodes x and y in the copied list, x.random --> y.

Return the head of the copied linked list.

The linked list is represented in the input/output as a list of n nodes. Each node is represented as a pair of [val, random_index] where:

• val: an integer representing Node.val
• random_index: the index of the node (range from 0 to n-1) that the random pointer points to, or null if it does not point to any node.

Your code will only be given the head of the original linked list.

Example 1:

Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]

Example 2:

Input: head = [[1,1],[2,1]]
Output: [[1,1],[2,1]]

Example 3:

Input: head = [[3,null],[3,0],[3,null]]
Output: [[3,null],[3,0],[3,null]]

Constraints:

• 0 <= n <= 1000
• -10^4 <= Node.val <= 10^4
• Node.random is null or is pointing to some node in the linked list.

Approach - Hash Map 2 Passes

• In first loop we create new nodes and create a hash map to store the original node as key and new created copy node as value so as to access easily especially for random pointer
• add a key and value for null so as to cover the case for the pointer pointing to null
• In second loop we use hash map to locate our copied node then assign next and random based on it
• There exists other solutions too with better complexities but this seems very simple will check those later
• Time:O(n) Space: O(n)

/*
// Definition for a Node.
class Node {
    int val;
    Node next;
    Node random;
 
    public Node(int val) {
        this.val = val;
        this.next = null;
        this.random = null;
    }
}
*/
 
class Solution {
    public Node copyRandomList(Node head) {
        Map<Node, Node> copy = new HashMap<>();
        copy.put(null,null);
        Node curr = head;
    
        while (curr != null) {
            copy.put(curr, new Node(curr.val));
            curr = curr.next;
        }
 
        curr = head;
        while (curr != null) {
            Node node = copy.get(curr);
            node.next = copy.get(curr.next);
            node.random = copy.get(curr.random);
            curr = curr.next;
        }
 
        return copy.get(head);
    }
}