【面试题13】在O（1）时间删除链表结点

题目：给定单向链表的头指针和一个结点指针，定义函数在O（1）时间删除该结点。链表结点与函数的定义如下：

struct ListNode
{
    int m_nValue;
    ListNode* m_pNext;
};
void DeleteNode(ListNode** pListHead,ListNode* pToBeDeleted);

void DeleteNode(ListNode** pListHead,ListNode* pToBeDeleted)
{
    if(!=pListHead||!pToBeDeleted)
        return;

    //要删除的结点不是尾结点
    if(pToBeDeleted->m_pNext!=NULL)
    {
        ListNode* pNext=pToBeDeleted->m_pNext;
        pToBeDeleted->m_nValue=pNext->m_nValue;
        pToBeDeleted->m_pNext=pNext->m_pNext;

        delete pNext;
        pNext=NULL;
    }

    //链表中只有一个结点，删除头结点（尾结点）
    else if(*pListHead==pToBeDeleted)
    {
        delete pToBeDeleted;
        pToBeDeleted=NULL;
        *pListHead=NULL;
    }
    //链表中有多个结点，删除尾结点
    else
    {
        ListNode* pNode=*pListHead;
        while(pNode->m_pNext!=pToBeDeleted)
        {
            pNode=pNode->m_pNext;
        }
        pNode->m_pNext=NULL;
        delete pToBeDeleted;
        pTOBeDeleted=NULL;
    }
}