69,381
社区成员
发帖
与我相关
我的任务
分享
#include<string.h>
#include<ctype.h>
#include<malloc.h>
#include<stdio.h>
#include<stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
typedef int ElemType;
struct LNode
{
ElemType data;
struct LNode *next;
};
typedef struct LNode *LinkList;
Status InitList(LinkList *L){
*L = (LinkList)malloc(sizeof(struct LNode));
if(!*L)
exit(OVERFLOW);
(*L)->next = NULL;
return OK;
}
Status ListTraverse(LinkList L,void(*vi)(ElemType)){
LinkList p = L->next;
while(p)
{
vi(p->data);
p=p->next;
}
printf("\n");
return OK;
}
Status ListInsert(LinkList L,int i,ElemType e)
int j=0;
LinkList p=L,s;
while(p&&j<i-1)
{
p=p->next;
j++;
}
if(!p||j>i-1)
return ERROR;
s=(LinkList)malloc(sizeof(struct LNode));
s->data=e;
s->next=p->next;
p->next=s;
return OK;
}
void visit(ElemType c)
{
printf("%d ",c);
}
LinkList Merger2(LinkList L1,LinkList L2){
LinkList la = L1->next;
LinkList lb = L2->next;
if(la == NULL)
return lb;
else if(lb == NULL)
return la;
LinkList pHead = NULL;
if(la->data < lb->data){
pHead = la;
pHead->next = Merger2(la->next,lb);
}else{
pHead = lb;
pHead->next = Merger2(la,lb->next);
}
return pHead;
}
int main(){
LinkList L1,L2;
ElemType e,e0;
Status i1,i2;
int j,k;
i1 = InitList(&L1);
i2 = InitList(&L2);
for(j=1;j<=5;j++){
i1=ListInsert(L1,j,j*3);
}
for(k=1;k<=6;k++){
i2=ListInsert(L2,k,k*2);
}
printf("L1=");
ListTraverse(L1,visit);
printf("L2=");
ListTraverse(L2,visit);
printf("Mergered List:");
LinkList Mergered = Merger2(L1,L2);
ListTraverse(Mergered,visit);
return 0;
}