/*
12.已知二个单链表有序链表la与lb,其中la={a1,a2,…an},lb={b1,b2,…bm},
试设计一个算法将它们合并到单链表lc中,且lc仍然有序,再输出 。
*/
# include <iostream>
# include <stdio.h>
# include <stdlib.h>
using namespace std;
typedef struct Node
{
int elem;
struct Node *next;
}*linklist;
void inlinklist(linklist &l, int n)
{
l = (linklist) malloc (sizeof(Node));
l->next = NULL;
linklist p, end;
end = l;
printf("请输入链表中的元素:\n");
for(int i = 0; i<n; i++)
{
p = (linklist) malloc (sizeof(Node));
scanf("%d", &p->elem);
end->next = p;
p->next = NULL;
end = p;
}
}
void outlinklist(linklist l)
{
printf("链表中的元素为:\n");
linklist p;
p = l->next;
while(p != NULL)
{
printf("%d ", p->elem);
p = p->next;
}
printf("\n");
}
void swap(linklist& a, linklist &s)
{
s->next = a;
s = a;
a = a->next;
}
void mergerlinklist(linklist &l1, linklist &l2, linklist &l3)
{
l3 = (linklist) malloc (sizeof(Node));
linklist a, b, c;
a = l1->next;
b = l2->next;
c = l3;
while(a && b)
{
if(a->elem > b->elem)
{
//c->next = b;
//b = b->next;
//c = c->next;
swap(b, c);
}
else
{
//c->next = a;
//a = a->next;
//c = c->next;
swap(a, c);
}
}
c->next = a ? a : b;
/*while(a)
{
c->next = a;
c = c->next;
a = a->next;
}
while(b)
{
c->next = b;
c = c->next;
b = b->next;
}
c->next = NULL;*/
}
int main()
{
linklist l1, l2, l3;
int n, m;
printf("请输入链表的元素个数:\n");
scanf("%d%d", &n, &m);
inlinklist(l1, n);
inlinklist(l2, m);
mergerlinklist(l1, l2, l3);
outlinklist(l3);
return 0;
}