C++实现无序单链表合并为有序链表

#include
using namespace std;
typedef struct LNode_ {
int data;
struct LNode_ * next;
}LNode, *LinkList;

void InitList_L(LinkList &L) //创建单链表
{
L = new LNode;
L->next = NULL;
}
void input(LinkList &L, int n) //依次往单链表L里输入数据
{
LNode *p;
L = new LNode;
L->next = NULL;
for (int i = 0; i < n; i++)
{
p = new LNode;
cin >> p->data;
p->next = L->next; L->next = p;
}
}

void output(LinkList &L,int n) //依次输出单链表里的每个元素

{
int i, t, a[5];
LNode *p;
p = L->next;
for ( i = 0; i < n; i++, p = p->next)a[i] = p->data;
for (i = 1; i < n; i++)
for (int j = 0; j<n - i; j++)
{
if (a[j] > a[j + 1]) { t = a[j]; a[j] = a[j + 1]; a[j + 1] = t;}
}
p = L->next;
for (i = 0; i < n; i++) { p->data = a[i]; p = p->next; }
cout << “排序后顺序为：”;
for (i = 0; i < n; i++) cout << a[i] << " "; cout << endl;

}

LinkList MergetList(LinkList &La, LinkList &Lb,LinkList &Lc)
{
LNode *pa, *pb, *pc;
pa = La->next;
pb = Lb->next;
Lc = La;
pc = La;
while (pa&&pb)
{
if (pa->data data)
{
pc->next = pa;
pc = pa;
pa = pa->next;
}
else if(pa->data>pb->data)
{
pc ->next=pb;
pc = pb;
pb = pb->next;

	}
	else
	{
		pc->next = pa; pc = pa; pa = pa->next; pb = pb->next;
	}
}
pc -> next = pa ? pa : pb;
delete Lb;
return Lc;

}

void Display(LinkList L)
{
LNode *p;
p = new LNode;
p = L->next;
cout << “合并的链表为：”;
while §
{
cout << p->data << " ";
p = p->next;
}
}
int main()
{
int num_a=5, num_b=5;
LinkList La, Lb, Lc;

InitList_L(La); //La表的创建
input(La, num_a);
output(La,5 );
InitList_L(Lb); //Lb表的创建	
input(Lb, num_b); //依次往单链表La里输入数据
output(Lb, 5);
InitList_L(Lc);
MergetList(La, Lb, Lc); //将单链表La和Lb进行合并
Display(Lc);
system("pause");
return 0;

}