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

 写了几遍都是rumtime error，这种指针的操作一定要思考清楚边界情况：到达链表末尾时，有些元素可能是null，因此就不可再对其进行访问了。

算法：

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) {
        // insert nodes between each two linked nodes
        RandomListNode *cur = head, *next;
        while (cur)
        {
            next = cur->next;
            cur->next = new RandomListNode(cur->label); // copy node
            cur->next->next = next;
            cur = next;
        }
        
        // link random nodes
        cur = head;
        while (cur)
        {
            if (cur->random) cur->next->random = cur->random->next;
            cur = cur->next->next;
        }
        
        // pick list copy
        RandomListNode *chead = !head ? NULL : head->next;
        cur = head;
        while (cur)
        {
            next = cur->next;
            if (next) cur->next = next->next;
            cur = next;
        }
        return chead;
    }
};