~~~笔锋至此又怎能平淡而终,故事开始便不承认普通✌✌✌
如果需要完整代码可以关注下方公众号,后台回复“代码”即可获取,阿光期待着您的光临~
题目:
假设有两个按元素值递增次序排序的线性表,均已单链表形式存储,请编写算法将这两个单链表归并为一个按元素值递减次序排序的但连败哦,并要求利用原来两个单链表的结点存放归并后的单链表。
解题思路:
>归并排序
代码实现:
#include <iostream>
using namespace std;
typedef struct LNode
{
int data;
struct LNode *next;
} LNode, *LinkList;
// 头插法
void HeadInsert(LinkList &L)
{
int val = 0;
while (cin >> val)
{
LNode *s = new LNode;
s->data = val;
s->next = L->next;
L->next = s;
if (cin.get() == '\n')
{
break;
}
}
}
// 尾插法
void TailInsert(LinkList &L)
{
int val = 0;
LNode *r = L;
while (cin >> val)
{
LNode *s = new LNode;
s->data = val;
r->next = s;
r = s;
r->next = NULL;
if (cin.get() == '\n')
{
break;
}
}
}
// 遍历输出链表元素
void Print(LinkList L)
{
LNode *p = L->next;
while (p)
{
cout << p->data << '\t';
p = p->next;
}
cout << endl;
}
void MergeList(LinkList &LA, LinkList &LB)
{
LNode *pa, *pb, *r; //分别保存LA、LB工作指针和用于临时保存后继指针
pa = LA->next;
pb = LB->next;
LA->next = NULL; //将LA置为空表
while (pa && pb)
{
if (pa->data < pb->data)
{
r = pa->next;
pa->next = LA->next;
LA->next = pa;
pa = r;
}
else
{
r = pb->next;
pb->next = LA->next;
LA->next = pb;
pb = r;
}
}
//将表中剩余元素依次插入
while (pa)
{
r = pa->next;
pa->next = LA->next;
LA->next = pa;
pa = r;
}
while (pb)
{
r = pb->next;
pb->next = LA->next;
LA->next = pb;
pb = r;
}
delete LB;
}
int main()
{
LinkList LA = new LNode;
LinkList LB = new LNode;
TailInsert(LA);
TailInsert(LB);
MergeList(LA, LB);
Print(LA);
}