华为OJ（从单向链表中删除指定值的节点）

输入一个单向链表和一个节点的值，从单向链表中删除等于该值的节点，删除后如果链表中无节点则返回空指针。
链表结点定义如下：struct ListNode{      int       m_nKey;      ListNode* m_pNext;};详细描述：本题为考察链表的插入和删除知识。链表的值不能重复构造过程，例如1 -> 23 -> 25 -> 14 -> 57 -> 2最后的链表的顺序为 2 7 3 1 5 4 删除 结点 2 则结果为 7 3 1 5 4

#include<iostream>
using namespace std;
struct Node
{
int m_key;
Node * m_pnext;
};
int pInsert(Node* phead,int insert_key,int find_key)
{
if(phead==NULL)
return 0;
Node * pNode=phead;
while(pNode->m_key!=find_key&&pNode!=NULL)
{
pNode=pNode->m_pnext;
}
Node * Node_insert=new Node;
Node_insert->m_key=insert_key;
Node_insert->m_pnext=pNode->m_pnext;
pNode->m_pnext=Node_insert;
return 1;
}
Node* pDelete(Node* phead,int delete_key)
{

Node* pNode=phead;
if(pNode->m_key==delete_key)
{
phead=pNode->m_pnext;
delete pNode;
return phead;
}
while(pNode->m_pnext->m_key!=delete_key)//找到被删除的前一个节点
pNode=pNode->m_pnext;
Node *pDestr=pNode->m_pnext;
pNode->m_pnext=pDestr->m_pnext;
delete pDestr;
return phead;
}
int pDestroy(Node* phead)
{
Node * pNode;
while(phead!=NULL)
{
pNode=phead->m_pnext;
delete phead;
phead=pNode;
}
return 1;
}
int main()
{
int n,head,insert_key,find_key,delete_key;
cin>>n>>head;
Node * phead=new Node;
phead->m_pnext=NULL;
phead->m_key=head;
for(int i=0;i<n-1;i++)
{
cin>>insert_key>>find_key;
pInsert(phead,insert_key,find_key);
}
cin>>delete_key;
phead=pDelete(phead,delete_key);
Node * pOut=phead;
while(pOut->m_pnext)
{
cout<<pOut->m_key<<" ";
pOut=pOut->m_pnext;
}
cout<<pOut->m_key<<endl;
pDestroy(phead);
//system("pause");
return 0;
}