#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef struct LinkedList{
int data;
struct LinkedList *next;
}LinkedList,*List;
int a[5]={1,2,3,4,5};
int b[5]={6,7,8,9,10};
int n=5;
void build(List &L1,List &L2){
L1=(List)malloc(sizeof(LinkedList));
L2=(List)malloc(sizeof(LinkedList));
LinkedList *s1;
LinkedList *s2;
LinkedList *r1=L1;
LinkedList *r2=L2;
for(int i=0;i<n;i++){
s1=(LinkedList *)malloc(sizeof(LinkedList));
s2=(LinkedList *)malloc(sizeof(LinkedList));
s1->data=a[i];
s2->data=b[i];
r1->next=s1;
r2->next=s2;
r1=r1->next;
r2=r2->next;
}
r1->next=NULL;
r2->next=NULL;
}
void show(List &L){
LinkedList *s=L->next;
while(s){
printf("%d ",s->data);
s=s->next;
}
}
void backwardMerge(List &L1,List &L2){
//取L1和L2采用头插法插入到L1
LinkedList *p1=L1->next;
LinkedList *p2=L2->next;
L1->next=NULL;//直接断链
LinkedList *r;
//r只是一个指向p1或p2的临时指针
//用来帮助p1和p2这两个工作指针移动
while(p1&&p2){//头插法
if(p1->data<=p2->data){
//先插p1
r=p1->next;//始终记录当前处理的链表节点后一个节点
p1->next=L1->next;
L1->next=p1;
p1=r; //L1链表工作指针后移
}else{
r=p2->next;
p2->next=L2->next;
L2->next=p2;
p2=r;
}
}
if(p2){
p1=p2;
}
while(p1){
r=p1->next;
p1->next=L1->next;
L1->next=p1;
p1=r;
}
}
int main(){
List L1,L2;
build(L1,L2);
show(L1);
printf("\n");
show(L2);
printf("\n");
printf("递减归并后:");
backwardMerge(L1,L2);
show(L1);
return 0;
}