Copy List with Random Pointer

Problem:  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

SOLUTION 1 HASH TABLE : HaspTable<Oroginal ListNode, CopyofListNode>

Each ListNode has only one mapping in the of the original list node. 

/**
 * Definition for singly-linked list with a random pointer.
 * class RandomListNode {
 *     int label;
 *     RandomListNode next, random;
 *     RandomListNode(int x) { this.label = x; }
 * };
 */
public class Solution {
    /**
     * @param head: The head of linked list with a random pointer.
     * @return: A new head of a deep copy of the list.
     */
    public RandomListNode copyRandomList(RandomListNode head) {
        // write your code here
        if (head == null) {
            return null;
        }
        Map<RandomListNode, RandomListNode> map = new HashMap<>();
        RandomListNode dummy = new RandomListNode(0);
        RandomListNode prev = dummy;
        RandomListNode newNode = null;
        while (head != null) {
            if (map.containsKey(head)) {
                newNode = map.get(head);
            } else {
                newNode = new RandomListNode(head.label);
                map.put(head, newNode);
            }
            prev.next = newNode;
            if (head.random != null) {
                if (map.containsKey(head.random)) {
                    newNode.random = map.get(head.random);
                } else {
                    newNode.random = new RandomListNode(head.random.label);
                    map.put(head.random, newNode.random);
                }
            }
            prev = newNode;
            head = head.next;
        }
        return dummy.next;
    }
}

SOLUTION 2: NO EXTRA SPACE. COPY EACH NODE TWICE.

/**
 * Definition for singly-linked list with a random pointer.
 * class RandomListNode {
 *     int label;
 *     RandomListNode next, random;
 *     RandomListNode(int x) { this.label = x; }
 * };
 */
public class Solution {
    /**
     * @param head: The head of linked list with a random pointer.
     * @return: A new head of a deep copy of the list.
     */
    public RandomListNode copyRandomList(RandomListNode head) {
        if (head == null) {
            return null;
        }
        RandomListNode tail = head;
        while (tail != null) {
            RandomListNode newNode = new RandomListNode(tail.label);
            newNode.next = tail.next;
            tail.next = newNode;
            tail = tail.next.next;
        }
        tail = head;
        while (tail != null) {
            if (tail.random != null) {
                tail.next.random = tail.random.next;
            }
            tail = tail.next.next;
        }
        RandomListNode dummy = new RandomListNode(0);
        RandomListNode prev = dummy;
        tail = head;
        while (tail != null) {
            prev.next = tail.next;
            tail = tail.next.next;
            prev = prev.next;
        }
        return dummy.next;
    }
}