Node* Dele(Node* head,int value)
{
if(NULL != head->next)
{
Node* p = head;
Node* q = p;
while(value != p->data&&p->next != NULL)
{
q=p;
p = p->next;
}
}
if(value == p->data)
{
q->next = p->next;
free(p);//一定要记得释放
}
else
{
cout<<"没有找到该节点!"<<endl;
}
return head;
}