70,022
社区成员




#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 Merge( List L1, List L2 ){
List L;
List head;
List Tmp,Tmp1,Tmp2;
Tmp1 = L1->Next;
Tmp2 = L2->Next;
head = ( List )malloc( sizeof( struct Node ) );
Tmp = head;
while( Tmp1 || Tmp2 ){
L = ( List )malloc( sizeof( struct Node ) );
//若Tmp1为NULL,则将Tmp2->Data复制给L
if( !Tmp1 ){
L->Data = Tmp2->Data;
Tmp2 = Tmp2->Next;
}
else if( !Tmp2 ){
L->Data = Tmp1->Data;
Tmp1 = Tmp1->Next;
}
else{
//注意要求为非递减,故条件为<=,若为递增则改为<
//且增加二者相等时
if( Tmp1->Data <= Tmp2->Data ){
L->Data = Tmp1->Data;
Tmp1 = Tmp1->Next;
}
else if( Tmp2->Data < Tmp1->Data ){
L->Data = Tmp2->Data;
Tmp2 = Tmp2->Next;
}
}
Tmp->Next = L;
Tmp = L;
}
//由于结束后L1 L2输出为NULL,故empty L1和L2
L1->Next = NULL;
L2->Next = NULL;
return head;
}
//题中省略此部分,为方便调试,自行写一个
List Read(){
List head;
List p;
List r;
int n;
head = (List) malloc( sizeof( struct Node ) ) ;
r = head;
scanf( "%d",&n);
while( n-- ){
p = (List) malloc( sizeof( struct Node ) );
scanf( "%d", &p->Data );
r->Next = p;
r = p;
}
r->Next = NULL;
return head;
}
void Print( List L ){
List p;
p = L->Next;
if( p == NULL ){
printf("NULL\n");
return;
}
while( p ){
printf( "%d",p->Data );
p = p->Next;
if( p )
printf(" ");
}
printf("\n");
}
#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);
List Merge(List L1, List L2);
List my_merge_link(List hd1, List hd2);
int main()
{
List L1, L2, L;
L1 = Read();
L2 = Read();
Print(L1);
Print(L2);
/*
L = Merge(L1, L2);
Print(L);
*/
L = my_merge_link(L1, L2);
Print(L);
return 0;
}
List my_merge_link(List hd1, List hd2)
{
List pcur, pcur1, pcur2;
List hd;
pcur1 = hd1->Next;
pcur2 = hd2->Next;
hd = (List)malloc(sizeof(struct Node));
pcur = hd;
while (pcur1 && pcur2) {
if (pcur1->Data < pcur2->Data) {
pcur->Next = pcur1;
pcur = pcur1;
pcur1 = pcur1->Next;
} else {
pcur->Next = pcur2;
pcur = pcur2;
pcur2 = pcur2->Next;
}
}
if (pcur1) {
pcur->Next = pcur1;
pcur = pcur1;
pcur1 = pcur1->Next;
}
if (pcur2) {
pcur->Next = pcur2;
pcur = pcur2;
pcur2 = pcur2->Next;
}
return hd;
}
//将两个链表表示的递增整数序列合并为一个非递减的整数序列
List Merge(List L1, List L2)
{
List L;
List head;
List Tmp, Tmp1, Tmp2;
Tmp1 = L1->Next;
Tmp2 = L2->Next;
head = (List)malloc( sizeof( struct Node ) );
Tmp = head;
while( Tmp1 || Tmp2 ){
L = ( List )malloc( sizeof( struct Node ) );
//若Tmp1为NULL,则将Tmp2->Data复制给L
if( !Tmp1 ){
L->Data = Tmp2->Data;
Tmp2 = Tmp2->Next;
}
else if( !Tmp2 ){
L->Data = Tmp1->Data;
Tmp1 = Tmp1->Next;
}
else{
//注意要求为非递减,故条件为<=,若为递增则改为<
//且增加二者相等时
if( Tmp1->Data <= Tmp2->Data ){
L->Data = Tmp1->Data;
Tmp1 = Tmp1->Next;
}
else if( Tmp2->Data < Tmp1->Data ){
L->Data = Tmp2->Data;
Tmp2 = Tmp2->Next;
}
}
Tmp->Next = L;
Tmp = L;
}
//由于结束后L1 L2输出为NULL,故empty L1和L2
L1->Next = NULL;
L2->Next = NULL;
return head;
}
//题中省略此部分,为方便调试,自行写一个
List Read(){
List head;
List p;
List r;
int n;
head = (List) malloc( sizeof( struct Node ) ) ;
r = head;
printf("Please input the number of nodes: ");
scanf( "%d",&n);
while(n--){
p = (List) malloc( sizeof( struct Node ) );
printf("Pleaes input data: ");
scanf("%d", &p->Data );
r->Next = p;
r = p;
}
r->Next = NULL;
return head;
}
void Print( List L ){
List p;
p = L->Next;
if( p == NULL ){
printf("NULL\n");
return;
}
while( p ){
printf( "%d",p->Data );
p = p->Next;
if( p )
printf(" ");
}
printf("\n");
}
my_merge_link函数