将两个非递增链表合并,要求合并后的链表也按非递增:
#include <stdio.h>
#include <stdlib.h>
typedef struct LNode{
int data;//数据
struct LNode *next;//指针
}LinkList;
void InitList(LinkList *L){
L = (LinkList *)malloc(sizeof(LinkList));
//L指向头节点,L->next指向首元结点
L->next = NULL;
}
//建立单链表(头插法)
void CreateList(LinkList *L){
int n;
printf("请输入链表长度:");
scanf("%d",&n);
printf("请输入链表元素:");
for(int i=n;i>0;--i){
LinkList *p = (LinkList *)malloc(sizeof(LinkList));
scanf("%d",&p->data);
p->next = L->next;
L->next = p;
}
}
//有序链表的合并(非递增)
void MergeList(LinkList *La,LinkList *Lb,LinkList *Lc){
LinkList *pa = La->next;
LinkList *pb = Lb->next;
LinkList *pc = Lc;
while (pa&&pb) {
if(pa->data>=pb->data){
pc->next = pa;
pc = pa;
pa = pa->next;
}
else{
pc->next = pb;
pc = pb;
pb = pb->next;
}
}
pc->next = pa?pa:pb;
}
//输出链表
void printfList(LinkList *L){
LinkList *p;
p = L->next;
while(p){
printf("%d ",p->data);
p = p->next;
}
printf("\n");
}
int main(int argc, const char * argv[]) {
LinkList La,Lb,Lc;
InitList(&La);
InitList(&Lb);
InitList(&Lc);
CreateList(&La);
CreateList(&Lb);
printf("La链表的元素:");
printfList(&La);
printf("Lb链表的元素:");
printfList(&Lb);
MergeList(&La, &Lb, &Lc);
printf("合并后Lc链表的元素:");
printfList(&Lc);
}