已知两个非降序链表序列S1与S2,设计函数构造出S1与S2的交集新链表S3。
输入格式:
输入分两行,分别在每行给出由若干个正整数构成的非降序序列,用−1表示序列的结尾(−1不属于这个序列)。数字用空格间隔。
输出格式:
在一行中输出两个输入序列的交集序列,数字间用空格分开,结尾不能有多余空格;若新链表为空,输出NULL
。
输入样例:
1 2 5 -1
2 4 5 8 10 -1
输出样例:
2 5
#include <stdio.h>
#include <malloc.h>
typedef int Elemtype;
typedef int Status;
#define OK 1
#define ERROR 0
typedef struct Link_list
{
Elemtype date;
struct Link_list *next;
} *SqList;
SqList InitList()
{
SqList L;
L=(SqList)malloc(sizeof(struct Link_list));
L->next = NULL;
return L;
}
void ListInsert(SqList L,Elemtype e)
{
SqList next=(SqList)malloc(sizeof(struct Link_list));
next->date = e;
L->next = next;
next->next=NULL;
}
void print(SqList L)
{ int f = 0;
L = L->next;
while(L!=NULL)
{
if(f == 0)
{
printf("%d",L->date);
f=1;
}
else printf(" %d",L->date);
L = L->next;
}
}
SqList Merge(SqList A,SqList B,SqList C)
{
A = A->next;
B = B->next;
SqList c = C;
while(A!=NULL&&B!=NULL)
{
if(A->date < B->date)
{
A = A ->next;
}
else if(A->date == B->date)
{
ListInsert(C,A->date);
C = C->next;
A = A ->next;
B = B ->next;
}
else{
B = B ->next;
}
}
return c;
}
int main()
{
SqList A = InitList();
SqList B= InitList();
SqList C= InitList();
SqList a = A;
SqList b = B;
while(1)
{
int e;
scanf("%d",&e);
if(e==-1)
break;
ListInsert(A,e);
A = A->next;
}
while(1)
{
int e;
scanf("%d",&e);
if(e==-1)
break;
ListInsert(B,e);
B = B->next;
}
C = Merge(a,b,C);
if(C->next!=NULL)
print(C);
else printf("NULL");
}