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.

剑指offer里见过这个题，步骤分为复制，复制随机指针和拆分链表三步，具体的的分析见复杂链表的复制

代码：

/**
 * 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==NULL)
            return head;
        //复制
        RandomListNode *cur = head;
        while(cur!=NULL){
            RandomListNode *temp = new RandomListNode(cur->label);
            temp->next = cur->next;
            cur->next = temp;
            cur = temp->next;
        }
        //复制随机指针
        cur = head;
        while(cur->next!=NULL){
            cur->next->random = cur->random;
            if(cur->next->next!=NULL)
                cur = cur->next->next;
            else
                break;
            //这里如果不写else会进入最后一对儿节点的死循环
        }
        //拆分
        cur = head;
        RandomListNode *pClone = head->next;
        while(cur->next!=NULL){
            RandomListNode *temp = cur->next;
            cur->next = temp->next;
            cur = temp;//只往后移一个，链表里的 每一个元素都这么处理（包括pclone指向的那一条）
        }
        return pClone;
    }
};