用C#实现单链表（merge两个有序单链表）

namespace testing01
{
class Program
{
static LinkList<int> MyListA = new LinkList<int>();
static LinkList<int> MyListB = new LinkList<int>();
static LinkList<int> MyListC = new LinkList<int>();
static LinkNode<int> node;

static void Main(string[] args)
{
//创建升序单链表a
Console.Write("Pleae input the lenght of your ListLinkA,nA= ");
string strA = Console.ReadLine();
int nA;
nA= Convert.ToInt32(strA);
MyListA.CreateListHead(nA);

//创建升序单链表b
Console.Write("Pleae input the lenght of your ListLinkB,nB= ");
string strB = Console.ReadLine();
int nB;
nB = Convert.ToInt32(strB);
MyListB.CreateListHead(nB);

MyListC.MergeList(MyListA, MyListB); //merge

//输出新链表c
node = MyListC.Head;
while (node != null)
{
Console.WriteLine("The data of ListC are:{0}", node.Data);
node = node.Next;
}

Console.ReadLine();
}

}

}