单链表类

publicclassNode

{
publicTData{get;set;}
publicNodeNext{get;set;}
publicNode(Titem)
{
this.Data=item;
this.Next=null;
}
publicNode()
{
this.Data=default(T);
this.Next=null;
}
}[/mw_shl_code
[mw_shl_code=csharp,true]publicclassLinkList
{
publicNodeHead{get;set;}

publicLinkList()
{
Head=null;
}
///
///添加新元素到链尾
///
///
publicvoidAppend(Titem)
{
Nodefoot=newNode();
NodeA=newNode();
if(Head==null)
{
Head=foot;
return;
}
A=Head;
while(A.Next!=null)
{
A=A.Next;
}
A.Next=foot;
}
///
///删去链表元素
///
publicvoidDelete(inti)
{
if(i==1)//表头
{
Head=Head.Next;
return;
}
NodeA=newNode();
NodeB=newNode();
B=Head;
intj=1;
while(B.Next!=null&&j
{
A=B;
B=B.Next;
j++;
}
if(j==i)
{
A.Next=B.Next;
}
}
///
///核算链表元素个数
///
///
publicintGetLength()
{
Nodep=Head;
intlength=0;
while(p!=null)
{
p=p.Next;
length++;
}
returnlength;
}
///
///判断链表是否为空
///
///
publicboolIsEmpty()
{
if(Head==null)
returntrue;
else
returnfalse;
}
///
///清空链表
///
publicvoidClear()
{
Head=null;
}
///
///获取当前方位的结点值
///
///
///
publicTGetNodeValue(inti)
{
if(IsEmpty()||i<1||i>GetLength())
{
Console.WriteLine(“单链表为空或结点方位有误！”);
returndefault(T);
}
NodeA=newNode();
A=Head;
intj=1;
while(A.Next!=null&&j
{
A=A.Next;
j++;
}
returnA.Data;
}
///
///添加单链表刺进的方位
///
///
///
publicvoidInsert(Titem,intn)
{
if(IsEmpty()||n<1||n>GetLength())
{
Console.WriteLine(“单链表为空或结点方位有误！”);
return;
}
if(n==1)
{
NodeH=newNode();
H.Next=Head;
Head=H;
return;
}
//==========================取n结点的值===============
NodeA=newNode();
NodeB=newNode();
B=Head;
intj=1;
while(B.Next!=null&&j<n)
{
A=B;
B=B.Next;
j++;
}
//end=======================取n结点的值===============
if(j==n)
{
NodeC=newNode(item);
A.Next=C;
C.Next=B;
}
}
}