leetcode-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.

题意：拷贝一个带有随机指针的单链表。

分析：简单的思路是，用map<RandomListNode*, RandomListNode*> 记录原链表节点和新链表节点的关系，然后根据map连随机指针即可。

时间O(n)且空间O(1)的方法：

1. 先将每个节点后复制一个相同的节点，若原链表为1->2->3..，处理后为1->1->2->2->3->3...

2. 然后遍历链表，用p->next->random = p->random->next连上复制节点的随机指针，这一步是很巧妙的一点

3. 最后将原节点和复制节点分离

代码：

/**
 * 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 *p,*q;
        for(p=head; p; )
        {
            q = p->next;
            p->next = new RandomListNode(p->label);
            p->next->next = q;
            p = q;
        }
        for(p=head; p; p=p->next->next)
        {
            if(p->random)
                p->next->random = p->random->next;
        }
        RandomListNode *ret = head->next;
        for(p=head; p; )
        {
            q = p->next;
            p->next = q->next;
            p = p->next;
            if(!p) break;
            q->next = p->next;
        }
        return ret;
    }
};