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.

这个没啥算法，就是两遍遍历源链表， 第二次的时候构建出新的copy来返回。 之所以要两遍是因为这里有一个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) {
        unordered_map<RandomListNode*, RandomListNode*> rmap;
        RandomListNode *cur = head;
        while (cur != NULL) {
            RandomListNode *cnode = new RandomListNode(cur->label);
            rmap[cur] = cnode;
            cur = cur->next;
        }
        
        cur = head;
        while (cur != NULL) {
            RandomListNode *cnode = rmap[cur];
            if (cur->next != NULL) 
                cnode->next = rmap[cur->next];
            if (cur->random != NULL)
                cnode->random = rmap[cur->random];
                
            cur = cur->next;
        }
        
        return rmap[head];
    }
};