template void list ::delnode(int p)
{
int k=1;
listnode *ptr,*t;
ptr=first;
while(ptr->next!=NULL&&k!=p)
{
ptr=ptr->next;
k++;
}
t=ptr->next;
cout<<"ÄãÒѾ­½«Êý¾ÝÏî "< data<<"ɾ³ý"< ptr->next=ptr->next->next;
length¨C;
delete t;
}
ÔÚ½ÚµãPºó²åÈëÒ»¸ö½Úµã£º
template bool list ::insert(type t,int p)
{
listnode *ptr;
ptr=first;
int k=1;
while(ptr!=NULL&&k {
ptr=ptr->next;
k++;
}
if(ptr==NULL&&k!=p)
return false;
else
{
listnode *tp;
tp=new listnode ;
tp->data=t;
tp->next=ptr->next;
ptr->next=tp;
length++;
return true;
}
}