#include <stdio.h>
#include <stdlib.h>
#include "head.h"
typedef int ElemType;
typedef int Status;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
Status CreateList (LinkList &L)
{
LinkList s,r;
ElemType e;
L=(LinkList)malloc(sizeof (LNode));
if(!L)
exit(OVERFLOW);
L->next=NULL;
r=L;
while(scanf("%d",&e) && e!=END_DATA)
{
s=(LinkList)malloc(sizeof (LNode));
if(!s)
exit(OVERFLOW);
s->data=e;
s->next=r->next;
r->next=s;
r=s;
}
return OK;
}
Status MergeList (LinkList &La,LinkList &Lb,LinkList &Lc)
{
LinkList Pa,Pb,Pc;
Pa=La->next;
Pb=Lb->next;
Lc=Pc=La;
while(Pa&&Pb)
{
if(Pa->data<=Pb->data)
{
Pc->next=Pa;
Pc=Pa;
Pa=Pa->next;
}
else
{
Pc->next=Pb;
Pc=Pb;
Pb=Pb->next;
}
}
Pc->next=Pa?Pa:Pb;
free(Lb);
return 0;
}
void printElem (ElemType e)
{
printf(" %d",e);
}
void ListTravel (LinkList L,void(*visit)(ElemType))
{
LinkList p;
p=L->next;
while(p)
{
(*visit)(p->data);
p=p->next;
}
}
int main()
{
LinkList La,Lb,Lc;
CreateList (La);
ListTravel(La,printElem);
printf("\n");
CreateList(Lb);
ListTravel(Lb,printElem);
printf("\n");
MergeList(La,Lb,Lc);
ListTravel (Lc,printElem);
printf("\n");
return 0;
}
#include <stdlib.h>
#include "head.h"
typedef int ElemType;
typedef int Status;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
Status CreateList (LinkList &L)
{
LinkList s,r;
ElemType e;
L=(LinkList)malloc(sizeof (LNode));
if(!L)
exit(OVERFLOW);
L->next=NULL;
r=L;
while(scanf("%d",&e) && e!=END_DATA)
{
s=(LinkList)malloc(sizeof (LNode));
if(!s)
exit(OVERFLOW);
s->data=e;
s->next=r->next;
r->next=s;
r=s;
}
return OK;
}
Status MergeList (LinkList &La,LinkList &Lb,LinkList &Lc)
{
LinkList Pa,Pb,Pc;
Pa=La->next;
Pb=Lb->next;
Lc=Pc=La;
while(Pa&&Pb)
{
if(Pa->data<=Pb->data)
{
Pc->next=Pa;
Pc=Pa;
Pa=Pa->next;
}
else
{
Pc->next=Pb;
Pc=Pb;
Pb=Pb->next;
}
}
Pc->next=Pa?Pa:Pb;
free(Lb);
return 0;
}
void printElem (ElemType e)
{
printf(" %d",e);
}
void ListTravel (LinkList L,void(*visit)(ElemType))
{
LinkList p;
p=L->next;
while(p)
{
(*visit)(p->data);
p=p->next;
}
}
int main()
{
LinkList La,Lb,Lc;
CreateList (La);
ListTravel(La,printElem);
printf("\n");
CreateList(Lb);
ListTravel(Lb,printElem);
printf("\n");
MergeList(La,Lb,Lc);
ListTravel (Lc,printElem);
printf("\n");
return 0;
}