初学数据结构,在链表的合成中想尝试不用结点,发现不管咋样都是错误的。
下面是代码
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 ); //对两个有序链表进行合并
//链表均带有头结点
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;
scanf("%d",&n);
List L=(List)malloc(sizeof(PtrToNode)); ///申请一个头结点
L->Next = NULL; ///头指针为空
if(n) ///当n不是0时
{
List r=L; ///r是一个中间变量的节点
for(int i=0;i<n;i++)
{
List p=(List)malloc(sizeof(struct Node));
scanf("%d",&(p->Data)); ///尾插法
r->Next = p;
r = p;
}
r->Next = NULL;
}
return L;
}
void Print( List L )
{
List p=L->Next;
if(p)
{
List r;
r = L;
while(r->Next)
{
r = r->Next;
printf("%d ",r->Data);
}
}
else
{
printf("NULL");
}
printf("\n ");
}
List Merge( List L1, List L2 )
{
List L,p,a,b;
L = (List)malloc(sizeof(struct Node));
p = L->Next;
a = L1->Next;
b = L2->Next;
while(a && b)
{
if(a->Data < b->Data)
{
p->Data = a->Data;
p = p->Next;
a = a->Next;
}
else if(a->Data == b->Data)
{
p->Data = a->Data;
p = p->Next;
a = a->Next;
b = b->Next;
}
else
{
p->Data = b->Data;
p = p->Next;
b = b->Next;
}
}
for( ;a;a = a->Next)
{
p->Data = a->Data;
p = p->Next;
}
for( ;b;b = b->Next)
{
p->Data = L2->Data;
p = p->Next;
}
L1->Next = NULL;
L2->Next = NULL;
p = NULL;
return L;
}