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.

分析

1. 复制每一个节点，复制后的节点放在原节点之后
2. 更新Random 指针
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) {
        RandomListNode *realCurr = head, *realNext = NULL;
        RandomListNode *copyHead = new RandomListNode(-1);
        RandomListNode *copyNode = NULL,*copyPrev =copyHead,*copyCurr= NULL;


        //1. Clone 每个节点，并连接到该节点后面
        while (realCurr)
        {
            realNext = realCurr->next;
            copyNode = new RandomListNode(realCurr->label);
            copyNode->next = realNext;
            realCurr->next = copyNode;
            realCurr = realNext;
        }

        //2. 克隆random 的指向
        realCurr = head;
        while (realCurr)
        {
            if (realCurr->random)
                realCurr->next->random = realCurr->random->next;
            realCurr = realCurr->next->next;    
        }
        realCurr = head;

        //3. 拆分成两个List
        while (realCurr)
        {
            realNext = realCurr->next->next;

            copyCurr = realCurr->next;
            copyPrev->next = copyCurr;
            copyPrev = copyPrev->next;

            realCurr->next = realNext;
            realCurr = realNext;

        }
        return copyHead->next;
    }
};