Copy List with Random Pointer（拷贝带有random指针的链表）

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的时候看到了这一题，这个方法还是很巧妙的，就是把链表的每一个元素都复制一份，复制的元素接在原始元素后面，然后再设置复制的元素的random指针，最后解开链表。
 

/**
 * 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 *ptr = head, *new_list = head, *res = NULL;
		// 下面的循环复制链表的每一个元素
		while (ptr)
		{
			RandomListNode *tmp = new RandomListNode(ptr->label);
			tmp->random = NULL;
			tmp->next = ptr->next;
			ptr->next = tmp;
			ptr = tmp->next;
		}
		res = head->next;
		// 下面的循环把复制的元素random设置为有效值
		for (ptr = head; ptr != NULL; ptr = ptr->next)
		{
			new_list = ptr->next;
			if (ptr->random) 
			{
				new_list->random = ptr->random->next;
			}
			ptr = ptr->next;
		}
		// 下面的循环把链表解开成两个链表
		for (ptr = head; ptr != NULL; ptr = ptr->next)
		{
			new_list = ptr->next;
			RandomListNode *temp = new_list->next;
			if (temp) new_list->next = temp->next;
			else new_list->next = NULL;
			ptr->next = temp;
		} 
		return res;
	}
};