#105 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.

Have you met this question in a real interview? 

Yes

Example

Challenge 

Could you solve it with O(1) space?

题目思路：

这题我用了two-pass来做。第一次遍历主要用来建新的node，以及把label-node之间的关系存在map中。第二次遍历用map的信息来建random pointer之间的联系。

Mycode（AC = 199ms）：

/**
 * 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:
    /**
     * @param head: The head of linked list with a random pointer.
     * @return: A new head of a deep copy of the list.
     */
    RandomListNode *copyRandomList(RandomListNode *head) {
        // write your code here
        RandomListNode *dummy = new RandomListNode(0);
        RandomListNode *tmp_copy = dummy, *tmp = head;
        
        map<int, RandomListNode*> helper;
        
        // first-pass to copy the list and list next relationship
        // store the label-node relationship into map
        while (tmp) {
            tmp_copy->next = new RandomListNode(tmp->label);
            helper[tmp->label] = tmp_copy->next;
            tmp_copy = tmp_copy->next;
            tmp = tmp->next;
        }
        
        // second-pass to assign random nodes for each node
        tmp_copy = dummy->next; tmp = head;
        while (tmp) {
            if (tmp->random) {
                tmp_copy->random = helper[tmp->random->label];
            }
            
            tmp_copy = tmp_copy->next;
            tmp = tmp->next;
        }
        
        return dummy->next;
    }
};