待删指针不是尾指针：
      待删指针的值用待删指针的下一个指针的值覆盖
      删掉待删指针的下一个指针
待删指针是尾指针：
      待删指针同时是头指针：
            删掉头指针
     待删指针不是头指针
            找到待删指针的前一个指针
            删掉待删指针，前一个指针的next赋值为空

bool deleteNode(ListNode *&head, ListNode *p)
{
    if(!p || !head)
        return false;
    if(p->m_pNext != NULL)   //不是尾指针
    {
        ListNode *del = p->m_pNext;
        p->m_nValue = del->m_nValue;
        p->m_pNext = del->m_pNext;
        delete del;
        del = NULL;
    }
    else if(head == p)       //是尾指针，同时只有一个结点
    {
        delete p;
        head = NULL;
    }
    else                     //是尾指针，同时有多个结点
    {
        ListNode *tmp = NULL, *pre = head;
        while(pre->m_pNext != p)
        {
            pre = pre->m_pNext;
        }
        delete p;
        p = NULL;
        pre->m_pNext = NULL;
    }
    return true;
}

#include <iostream>
using namespace std;

struct ListNode
{
    int m_nValue;
    ListNode* m_pNext;
};

void createList(ListNode *head)
{
    head = new(ListNode);
    head->m_nValue = 1;
    head->m_pNext = NULL;
}
void deleteList(ListNode *p)
{
    ListNode *next = NULL;
    while(p != NULL)
    {
        cout << p->m_nValue << endl;
        next = p->m_pNext;
        delete p;
        p = NULL;
        p = next;
    }
}

int main()
{
    ListNode *head = NULL;
    createList(head);
    cout << head << endl;
    deleteList(head);
}