链表的删除算法

bool List::Remove(int i;int&x){
LinkNode *del,*current;
if(i<=1){
del=first;
first=first->link;
}
else{
current=first;
for(int k=1;k<i-1;k++)
if(current==NULL) break;
else current=current->link;
if(current==NULL||current->link==NULL)
{
cerr<<"无效删除位置 \n";
return false;
}
del=current->link;
current->link=del->link;
}
x=del->data;
delete del;
return true;
};