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.

題意：深度復(fù)制一個帶隨機(jī)指針的鏈表。

思路：
開始是按照之前深度復(fù)制圖的做法，利用深度優(yōu)先搜索結(jié)合hashmap，但是遇到了棧溢出的bug，原因是這個鏈表的隨機(jī)指針有可能會無限循環(huán)，比如A隨機(jī)指向B，B隨機(jī)指向A。下面是有bug的代碼：

public RandomListNode copyRandomList(RandomListNode head) {

    Map<RandomListNode, RandomListNode> map = new HashMap<>();

    return copyHelper(head, map);
}

private RandomListNode copyHelper(RandomListNode node, Map<RandomListNode, RandomListNode> map) {
    if (node == null) {
        return null;
    }
    if (map.containsKey(node)) {
        return map.get(node);
    }

    RandomListNode copyNode = new RandomListNode(node.label);
    copyNode.next = copyHelper(node.next, map);
    copyNode.random = copyHelper(node.random, map);
    map.put(node, copyNode);

    return copyNode;
}

意識到bug是什么以后，就考慮如何避免random導(dǎo)致的死循環(huán)，想到了其實每個節(jié)點(diǎn)最多只有一個random指針，沒必要把random加到搜索任務(wù)中?？梢韵缺闅v鏈表，建立映射關(guān)系，然后再遍歷一次，把克隆節(jié)點(diǎn)連接起來。

public RandomListNode copyRandomList(RandomListNode head) {
if (head == null) {
return null;
}

    HashMap<RandomListNode, RandomListNode> map = new HashMap<>();
    RandomListNode dummy = head;
    while (dummy != null) {
        RandomListNode copy = new RandomListNode(dummy.label);
        map.put(dummy, copy);
        dummy = dummy.next;
    }

    Queue<RandomListNode> q = new LinkedList<>();
    q.offer(head);
    while (!q.isEmpty()) {
        RandomListNode cur = q.poll();
        RandomListNode copy = map.get(cur);
        if (cur.next != null) {
            copy.next = map.get(cur.next);
            q.offer(cur.next);
        }
        if (cur.random != null) {
            copy.random = map.get(cur.random);
        }
    }

    return map.get(head);
}