[提交] [统计] [提问]
题目描述
已知两个非降序链表序列S1与S2,设计函数构造出S1与S2的并集新非降序链表S3。
输入描述
输入分两行,分别在每行给出由若干个正整数构成的非降序序列,用−1表示序列的结尾(−1不属于这个序列)。数字用空格间隔。
输出描述
在一行中输出合并后新的非降序链表,数字间用空格分开,结尾不能有多余空格;若新链表为空,输出NULL。
输入样例
1 3 5 -1
2 4 6 8 10 -1
输出样例
1 2 3 4 5 6 8 10
#include<stdio.h>
#include<stdlib.h>
typedef struct node* List;
struct node
{
int data;
struct node *next;
};
List Read()
{
int x;
List q, r, head;
scanf("%d", &x);
head = (List)malloc(sizeof(struct node));
r = head;
while(x != -1)
{
q = (List)malloc(sizeof(struct node));
q->data = x;
r->next = q;
r = q;
scanf("%d", &x);
}
r->next = NULL;
return head;
}
List LinkList(List La, List Lb)
{
List Lc, pa, pb, pc, ptr;
pa = La->next;
pb = Lb->next;
Lc = La;
pc = La;
while(pa != NULL && pb != NULL)
{
if(pa->data < pb->data)
{
pc->next = pa;
pc = pa;
pa = pa->next;
}
else if(pa->data > pb->data)
{
pc->next = pb;
pc = pb;
pb = pb->next;
}
else
{
pc->next = pa;
pc = pa;
pa = pa->next;
ptr = pb;
pb = pb->next;
free(ptr);
}
}
if(pa != NULL)
pc->next = pa;
else
pc->next = pb;
return (Lc);
}
void Print(List s)
{
int k;
k = 0;
s = s->next;
if(s == NULL)
{
printf("NULL");
return ;
}
while(s != NULL)
{
if(k != 0)
printf(" ");
printf("%d", s->data);
s = s->next;
k++;
}
printf("\n");
return ;
}
int main()
{
int x;
List s1, s2, s3;
s1 = Read();
s2 = Read();
s3 = LinkList(s1, s2);
Print(s3);
return 0;
}