数据结构单循环链表的创建和合并

//循环链表
#include<stdio.h>
#include<malloc.h>
typedef struct Node
{
int data;
    struct Node* next;
}Node,*LinkList;
void InitList(LinkList* L)
{
(*L) = (LinkList)malloc(sizeof(Node));
(*L)->next = (*L);
//(*L)=(*L)->next;这样写会出现错误，因为(*L)->next没有开辟空间，无效；
}
void CreateListHead(LinkList L)//头插法
{
int value;
Node* s;
scanf("%d",&value);
while(value != -1)
{
s = (Node*)malloc(sizeof(Node));
s->data = value;
s->next = NULL;
s->next = L->next;
L->next = s;
        scanf("%d",&value);
}
}
void ShowList(LinkList L)
{
Node* s;
s=L->next;
while(s != L)
{
printf("%d  ",s->data);
s = s->next;
}
printf("\n");
}
void CreateListTail(LinkList L)
{
int value;
Node* s;
Node* r;
r = L;
scanf("%d",&value);
while(value != -1)
{
s = (Node*)malloc(sizeof(Node));
s->data = value;
s->next = r->next;//插入操作都是先做后面，然后再做前面
r->next = s;
r = s;
scanf("%d",&value);
}
}
//将两个链表合并后放在LB中
void MergeList(LinkList L,LinkList LA)
{
Node* sl;
Node* sla;
sl = L;
sla = LA;
while(sl->next!=L)
{
sl = sl->next;
}
while(sla->next!=LA)
{
sla = sla->next;
}

sla->next = L;
sl->next = LA->next;
//free(LA);
}
int main(void)
{
LinkList L;
LinkList LA;
InitList(&L);
InitList(&LA);
CreateListHead(L);
ShowList(L);
CreateListTail(LA);
ShowList(LA);
MergeList(L,LA);//将链表LA合并在L后面
ShowList(L);
return 0;
}