用c语言实现链表,用C语言实现链表的算法

tail)

{

q = p;

p=p->next;

}

if(p->data==data)

{printf("YOu have input the same datas %d\n\t YOu should input another data \n",data);

scanf("%d",&data);

OrderedInsert(List,data);

}

else

{

p=(LinkNode*)malloc(LEN);

p->data = data;

p->next = q->next;

q->next = p;

List->Listsize++;

}

}

}

void Creatset(OrderedList *List)//多次调用OrderedInsert()生成有序链表即集合List

{

Datatype data;

int setsize , i=0;

printf("Please input the setsize you want to creat:\n");

scanf("%d",&setsize);

InitList(List);

if(setsize==0)

printf("You needen't input any data\n");

else if(setsize==1)

printf("Please input a single data\n");

else

printf("Please input %d different datas;\n",setsize);

while(iList->Listsize)//当循环次数i小于setsize或者集合内实际元素数List.Listsize小于setsize时一直循环下去

{

scanf("%d",&data);

OrderedInsert(List,data);

i++;

}

}

void Append(OrderedList *List,Datatype data)//在循环链表的最后面追加 一个data

{

LinkNode *p;

p=(LinkNode*)malloc(LEN);

p->data=data;

List->tail=List->tail->next=p;

List->tail->next=List->head;

List->Listsize+=1;

}

void MergeList(OrderedList La,OrderedList Lb,OrderedList *Lc)//有序循环链表ListLa,ListLb求并集生成ListLc

{

LinkList Pa,Pb;

Pa=La.head->next;Pb=Lb.head->next;

while(Pa!=La.tail&&Pb!=Lb.tail)

{

if(Pa->data<=Pb->data)

{

Append(Lc,Pa->data);

Pa=Pa->next;

}

else {

Append(Lc,Pb->data);Pb=Pb->next;

}

}

while(Pa!=La.tail)

{ Append( Lc,Pa->data);Pa=Pa->next;}

while(Pb!=Lb.tail)

{ Append(Lc,Pb->data);Pb=Pb->next;}

}

void Print(OrderedList List)

{

LinkNode *p;

p=List.head->next;

if(p->next==List.head)

printf("No Elem\n");

while(p!=List.head)

{ printf("%5d",p->data);p=p->next; }

printf("\n");

}

void main()

{

OrderedList ListLa,ListLb,ListLc;

Creatset(&ListLa);

Creatset(&ListLb);

InitList(&ListLc);

MergeList(ListLa,ListLb,&ListLc);

printf("The orgnial list ListLa,ListLb:\n");

Print(ListLa);

Print(ListLb);

printf("The Merge list ListLc;\n");

Print(ListLc);

}