void remove( const int& data)
{
node* cur=head->next;
node* pre=head;
while(cur)
{
if(cur->data==data)
{
node* q=cur;
pre->next=cur->next;
cur=cur->next;
delete q;
}
else{
pre=cur;
cur=cur->next;
}
}
}
或:
template<class T>
void LinkList<T>::DeleteData(T data,Node<T>** head){
Node<T>* pre=NULL;
Node<T>* cur=*head;
while(cur->next&&data!=cur->data){
pre=cur;
cur=cur->next;
}
pre->next=cur->next;
}