138. 复制带随机指针的链表

https://leetcode-cn.com/problems/copy-list-with-random-pointer/description/

给定一个链表，每个节点包含一个额外增加的随机指针，该指针可以指向链表中的任何节点或空节点。

要求返回这个链表的深度拷贝。

/**
 * 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 NULL;
        }
        RandomListNode* cur = head;
        //复制next
        while (cur) {
            RandomListNode* temp = new RandomListNode(cur->label);
            temp->next = cur->next;
            cur->next = temp;
            cur = temp->next;
        }
        //复制random
        cur = head;
        while (cur) {
            RandomListNode* next = cur->next;
            if (cur->random) {
                next->random = cur->random->next;
            }
            cur = next->next;
        }
        //拆分
        RandomListNode* Head = new RandomListNode(-1);
        Head->next = head;
        RandomListNode* cur1 = head;
        RandomListNode* cur2 = Head;
        while (cur1) {
            cur2->next = cur1->next;
            cur2 = cur2->next;
            cur1->next = cur2->next;
            cur1 = cur1->next;
        }
        return Head->next;
    }
};