帶隨機指針域的單鏈表的複製

題目要求：複雜鏈表的複製。一個鏈表的每個節點，有一個指向next指針指向下一個節點，還有一
個random指針指向這個鏈表中的一個隨機節點或者NULL，現在要求實現複製這個鏈表，

返回複製後的新鏈表。

#define _CRT_SECURE_NO_WARNINGS 1
typedef int DataType;
#define NULL 0
#include<stdio.h>
#include<windows.h>
#include<assert.h>
typedef struct Node
{
	DataType data;
	struct Node*next;
	struct Node*random;
}Node, *LinkList;
void InitList(LinkList *L)
{
	*L = (Node*)malloc(sizeof(Node));
	if (*L == NULL){
		printf("申請內存空間失敗");
	}
	(*L)->next = NULL;
}
LinkList BuyNode(DataType data)
{
	LinkList NewNode = NULL;
	NewNode = (LinkList)malloc(sizeof(Node));
	if (NewNode == NULL){
		printf("爲節點創建空間失敗");
	}
	NewNode->data = data;
	NewNode->random =NULL;
	NewNode->next = NULL;
	return NewNode;
}
void PrintList(LinkList L)
{
	LinkList Cur = L;
	if (L == NULL){
		printf("NULL");

	}
	while (Cur)
	{
		if (Cur == NULL)
			return;
		printf("%d %d--->", Cur->data,Cur->random->data);
		Cur = Cur->next;
	}
	printf("NULL\n");
}
void PushBack(LinkList* L, DataType data)
{
	assert(L);
	LinkList Cur = *L;
	if (Cur == NULL){
		Cur = BuyNode(data);
	}
	while (Cur->next)
	{
		Cur = Cur->next;
	}
	Cur->next = BuyNode(data);
}
LinkList Find(LinkList L, DataType data)
{
	assert(L);
	if (L == NULL){
		return NULL;
	}
	LinkList Cur = L;
	while (Cur != NULL)
	{
		if (Cur->data == data){
			return Cur;
		}
		Cur = Cur->next;
	}
	return NULL;
}
LinkList CopyLinkListwithRandompoint(LinkList L)
{
	LinkList CopyL = NULL;
	LinkList Cur = NULL;
	LinkList Tail = NULL;
	LinkList NewNode = NULL;
	if (L == NULL)
		return NULL;
	else if (L->next == NULL)
		CopyL = L->next;
	Cur = L->next;
	while (Cur->next)        //在單鏈表每一個節點後面插入一個data與原來鏈表
	{                             //相同的節點
		NewNode = BuyNode(Cur->data);
		NewNode->next = Cur->next;
		Cur->next = NewNode;
		Cur = NewNode->next;
	}
	NewNode = BuyNode(Cur->data);
	Cur->next = NewNode;
	Cur = L->next;                      //爲新插入的節點賦隨機域
	while(Cur)
	{
		NewNode = Cur->next;
		NewNode->random = Cur->random->next;
		Cur = NewNode->next;
	}            //拆鏈表爲原鏈表和複製後之後的鏈表
	Cur = L->next;
	NewNode = Cur->next;
	Cur->next = NewNode->next;
	NewNode->next = NULL;
	CopyL = NewNode;
	Tail = NewNode;
	while (1)
	{
		Cur = Cur->next;
		NewNode = Cur->next;
		if (NULL == NewNode->next)
			break;
		Cur->next = NewNode->next;
		NewNode->next = NULL;
		Tail->next = NewNode;
		Tail = Tail->next;
	}
	Cur->next = NULL;
	Tail->next = NewNode;
	Tail = Tail->next;
	return CopyL;
}
void test()
{
	LinkList L;
	InitList(&L);
	PushBack(&L, 1);
	PushBack(&L, 2);
	PushBack(&L, 3);
	PushBack(&L, 4);
	L->random = NULL;
	LinkList L1 = Find(L, 1);
	LinkList L2 = Find(L, 2);
	LinkList L3 = Find(L, 3);
	LinkList L4 = Find(L, 4);
	L1->random = L4;
	L2->random = L3;
	L3->random = L1;
	L4->random = L2;
    PrintList(CopyLinkListwithRandompoint(L));
}
int main()
{
	test();
	system("pause");
	return 0;