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.

这题的难点在于如何合理的复制random指针这个属性。当我们先不考虑random，把整个链表复制一遍之后，最笨的方法就是对每个结点的random进行遍历查找，定位后再在新链表里指向同样的位置。具体代码如下：

/**
 * Definition for singly-linked list with a random pointer.
 * struct RandomListNode {
 *     int label;
 *     RandomListNode *next, *random;
 *     RandomListNode(int x) : label(x), next(NULL), random(NULL) {}
 * };
 */
class Solution {
public:
    RandomListNode *copyRandomList(RandomListNode *head) {
        if (!head) return NULL;
        RandomListNode *res = new RandomListNode(head->label);
        RandomListNode *p, *q;
        p = head->next;
        q = res;
        while (p != NULL) {
            q->next = new RandomListNode(p->label);
            p = p->next;
            q = q->next;
        }
        p = head;
        q = res;
        RandomListNode *s1, *s2;
        while (p != NULL && q != NULL) {
            if (p->random == NULL) {
                p = p->next;
                q = q->next;
                continue;
            }
            s1 = head;
            s2 = res;
            while (s1 != p->random) {
                s1 = s1->next;
                s2 = s2->next;
            }
            q->random = s2;
            p = p->next;
            q = q->next;
        }
        return res;
    }
};

当然，这样做很慢。一个简单的优化是，可以用hash table建立新旧链表node之间的联系。其实我们并不需要知道random那个指针具体指向第几个，反正计算机知道那个地址，我们只需要把那个地址映射到新的链表里就行。代码如下：

class Solution {
public:
    RandomListNode *copyRandomList(RandomListNode *head) {
        if (!head) return NULL;
        RandomListNode *res = new RandomListNode(head->label);
        RandomListNode *p, *q;
        p = head->next;
        q = res;
        unordered_map<RandomListNode*, RandomListNode*> m;
        m[head] = res;
        while (p != NULL) {
            q->next = new RandomListNode(p->label);
            m[p] = q->next;
            p = p->next;
            q = q->next;
        }
        p = head;
        q = res;
        while (p != NULL && q != NULL) {
            q->random = m[p->random];
            p = p->next;
            q = q->next;
        }
        return res;
    }
};