链表尾部增加结点，打印结点，删除结点

链表的尾部增加结点；打印出结点，删除结点操作

#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
struct ListNode{
    int m_nValue;
    ListNode* m_pNext;
};
void addNode(ListNode **head,int value)//在链表尾部增加结点
{
    ListNode* pNew=new ListNode();
    pNew->m_nValue=value;
    pNew->m_pNext=NULL;
    if(*head==NULL)
    {
        *head=pNew;
    }
    else
    {
        ListNode *pNode=*head;
        while(pNode->m_pNext!=NULL)
            pNode=pNode->m_pNext;
        pNode->m_pNext=pNew;
    }
}
void printNode(ListNode* head)//打印结点
{
    ListNode* pNow=head;
    while(pNow!=NULL)
    {
        printf("%d ",pNow->m_nValue);
        pNow=pNow->m_pNext;
    }
    printf("\n");
}
void deleteNode(ListNode** head,int value)//找到第一个含有某值的结点并删除
{
    if(*head==NULL||head==NULL)//输入的链表空
        return ;
    ListNode* pToBeDelete=NULL;
    if((*head)->m_nValue==value)//头结点是要删除的结点
    {
        pToBeDelete=*head;
        *head=(*head)->m_pNext;
    }
    else
    {
        ListNode* pNow=*head;
        while(pNow->m_pNext!=NULL&&pNow->m_pNext->m_nValue!=value)
            pNow=pNow->m_pNext;
        if(pNow->m_pNext!=NULL&&pNow->m_pNext->m_nValue==value)
        {
            pToBeDelete=pNow->m_pNext;
            pNow->m_pNext=pNow->m_pNext->m_pNext;
        }
    }
    if(pToBeDelete!=NULL)
    {
        delete pToBeDelete;
        pToBeDelete=NULL;
    }
}
int main()
{
    int n,a;
    ListNode* head=NULL;
    while(scanf("%d",&n)!=EOF)//按ctrl+Z结束输入
    {
        addNode(&head,n);
    }
    printNode(head);
    printf("请输入要删除的结点的值：");
    scanf("%d",&a);
    deleteNode(&head,a);
    printf("删除后链表为：");
    printNode(head);
    return 0;
}