138 Copy List with Random Pointer [Leetcode]

题目内容：

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.

解题思路：
最优方法时间复杂度为O(n)且不需要额外空间。
步骤：
1. 复制普通链表，并将复制的节点插入在被复制节点的后面
2. 复制复杂指针，由于1中的布局，我们只需要将复制的节点的另一个指针指向被复制节点另一个指针的后面一个节点
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 == NULL)
            return NULL;

        RandomListNode *p = head;
        while(p != NULL) {
            RandomListNode *copy_node = new RandomListNode(p->label);
            copy_node->next = p->next;
            p->next = copy_node;
            p = copy_node->next;
        }

        p = head;
        RandomListNode *copy_head = p->next, *cp = copy_head;
        while(p != NULL) {
            cp = p->next;
            if(p->random != NULL)
                cp->random = p->random->next;
            p = cp->next;
        }

        //can't merge assign random point and split list, because random point may point to former node
        //split list
        p = head;
        cp = copy_head;
        while(cp->next != NULL) {
            p->next = cp->next;
            p = p->next;
            cp->next = p->next;
            cp = cp->next;
        }
        p->next = NULL;

        return copy_head;
    }
};