本题要求实现一个函数,将两个链表表示的递增整数序列合并为一个递增的整数序列。
函数接口定义:
List Merge( List L1, List L2 );
其中List
结构定义如下:
typedef struct Node *PtrToNode;
struct Node {
ElementType Data; /* 存储结点数据 */
PtrToNode Next; /* 指向下一个结点的指针 */
};
typedef PtrToNode List; /* 定义单链表类型 */
L1
和L2
是给定的带头结点的单链表,其结点存储的数据是递增有序的;函数Merge
要将L1
和L2
合并为一个递增的整数序列。应直接使用原序列中的结点,返回归并后的链表头指针。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node {
ElementType Data;
PtrToNode Next;
};
typedef PtrToNode List;
List Read(); /* 细节在此不表 */
void Print( List L ); /* 细节在此不表;空链表将输出NULL */
List Merge( List L1, List L2 );
int main()
{
List L1, L2, L;
L1 = Read();
L2 = Read();
L = Merge(L1, L2);
Print(L);
Print(L1);
Print(L2);
return 0;
}
<----------------------------------------------------------------------------------------------------------------->
<span style="font-family:SimHei;color:#FF6666;">#include <stdio.h>//读入输出测试
#include <stdlib.h>
typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node {
ElementType Data;
PtrToNode Next;
};
typedef PtrToNode List;
List Read(); /* 细节在此不表 */
void Print(List L); /* 细节在此不表;空链表将输出NULL */
List Merge(List L1, List L2);
int main()
{
List L1, L2,L;
L1 = Read();
L2 = Read();
L = Merge(L1, L2);
Print(L);
Print(L1);
Print(L2);
return 0;
}
List Read()
{
int n;
List L0;
L0 = (List)malloc(sizeof(struct Node));
L0->Next = NULL;
scanf("%d", &n);
if (n)
{
List r = L0;
List temp0;
for (int i = 0; i<n; i++) {
temp0 = (List)malloc(sizeof(struct Node));
scanf("%d", &(temp0->Data));
r->Next = temp0;
r = temp0;
}
r->Next = NULL;
}
return L0;
}
void Print(List L)
{
if (L->Next)
{
List tempp;
tempp = L;
while (tempp->Next)
{
tempp = tempp->Next;
printf("%d ", tempp->Data);
}
printf("\n");
}
else
{
printf("NULL\n");
}
}
List Merge(List L1, List L2)
{
List p1 = L1->Next, p2 = L2->Next, r;
List L3;
L3= (List)malloc(sizeof(struct Node));
r = L3;
while (p1 != NULL&&p2 != NULL)
{
if (p1->Data<p2->Data)
{
r->Next = p1;
r = p1;
p1 = p1->Next;
}else {
r->Next = p2;
r = p2;
p2 = p2->Next;
}
}
if (p1 != NULL)
r->Next = p1;
if (p2 != NULL)
r->Next = p2;
L1->Next = NULL;
L2->Next = NULL;
return L3;
}</span>
特别感谢MOOC网test同学写得测试用例,这道题让我纠结半天,幸好有他给的用例,不过用例没有写printf(L)函数,请注意http://ideone.com/YPHRjr