207MergeList

//mergeList.cpp
#include"C:\Users\Administrator\Documents\Visual Studio 2013\Projects\204LinkList\204LinkList\c1.h"
#include"C:\Users\Administrator\Documents\Visual Studio 2013\Projects\204LinkList\204LinkList\elemtype.h"
#include"C:\Users\Administrator\Documents\Visual Studio 2013\Projects\204LinkList\204LinkList\c2-2.h"
#include"C:\Users\Administrator\Documents\Visual Studio 2013\Projects\204LinkList\204LinkList\bo2-2.cpp"
#include"C:\Users\Administrator\Documents\Visual Studio 2013\Projects\204LinkList\204LinkList\function.h"

void MergeList(LinkList La, LinkList Lb, LinkList &Lc)
{
	InitList(Lc);
	int i = 0;
	LinkList pa = La->next, pb = Lb->next;
	while (pa && pb)
	{
		if (pa->data == pb->data)
		{
			ListInsert(Lc, ++i, pa->data);
			pa = pa->next;
			pb = pb->next;
		}
		else if (pa->data < pb->data)
		{
			ListInsert(Lc, ++i, pa->data);
			pa = pa->next;
		}
		else
		{
			ListInsert(Lc, ++i, pb->data);
			pb = pb->next;
		}
	}
	while (pa)
	{
		ListInsert(Lc, ++i, pa->data);
		pa = pa->next;
	}
	while (pb)
	{
		ListInsert(Lc,++i, pb->data);
		pb = pb->next;
	}
}

int main()
{
	LinkList La, Lb, Lc;
	InitList(La);
	InitList(Lb);
	for (int i = 0; i < 5; i++)
	{
		ListInsert(La, i + 1, i);
	}
	for (int i = 0; i < 8; i++)
	{
		ListInsert(Lb, i + 1, i + 2);
	}
	ListTraverse(La, print);
	cout << endl;
	ListTraverse(Lb, print);
	cout << endl;

	MergeList(La, Lb, Lc);
	ListTraverse(Lc, print);

	cin.get();
	return 0;
}