题目:给定单向链表的头指针和一个结点的指针,定义一个函数在O(1)时间删除该结点。链表结点与函数的定义如下:
代码如下:
#include<stdio.h>
#include<malloc.h>
#include<assert.h>
struct ListNode
{
int m_pValue;
struct ListNode* m_pNext;
}*head;
//增加一个结点
void addListTailNode(struct ListNode** pListNode,int _value)
{
assert(pListNode);
if (*pListNode == NULL)
{
*pListNode = (struct ListNode*)malloc(sizeof(struct ListNode));
(*pListNode)->m_pValue = _value;
(*pListNode)->m_pNext = NULL;
}
else
{
struct ListNode* _node = (struct ListNode*)malloc(sizeof(struct ListNode));
struct ListNode* begin = *pListNode;
while (begin->m_pNext)
begin = begin->m_pNext;
begin->m_pNext = _node;
_node->m_pValue = _value;
_node->m_pNext = NULL;
}
}
//查找要删除的结点
struct ListNode* findDelNode(struct ListNode** pListNode, int del)
{
assert(pListNode);
struct ListNode* begin = *pListNode;
while (begin)
{
if (begin->m_pValue == del)
{
return begin;
}
begin = begin->m_pNext;
}
return NULL;
}
//由于要求删除结点的效率为O(1),所以将查找提出来作为一个函数
void DeleteNode(struct ListNode** pListNode, struct ListNode* pToBeDeleted)
{
if (pListNode == NULL || pToBeDeleted == NULL)
{
return;
}
//删除头结点且只有一个结点
if (pToBeDeleted == *pListNode && (*pListNode)->m_pNext == NULL)
{
*pListNode = (*pListNode)->m_pNext;
free(pToBeDeleted);
pToBeDeleted = NULL;
*pListNode = NULL;
}
//删除尾结点
//此处尾结点删除后将删除的结点赋值为NULL,并没有将链表中最后一个结点next赋值为NULL(由于是C语言,没有将整个链表传进去),所以打印时会出现越界错误
//要修改此错误,必须将要删除的前一个结点记忆下来,并将其的next赋值为NULL
//此处问题未予修改,可以通过内存知道尾节点已经删除
if (pToBeDeleted->m_pNext == NULL)
{
free(pToBeDeleted);
pToBeDeleted = NULL;
}
else
{
//删除中间结点
struct ListNode* del = pToBeDeleted->m_pNext;
pToBeDeleted->m_pValue = del->m_pValue;
pToBeDeleted->m_pNext = del->m_pNext;
free(del);
del = NULL;
}
}
//打印该链表
void PrintList(struct ListNode** pListNode)
{
struct ListNode* begin = *pListNode;
while (begin)
{
printf("%d->", begin->m_pValue);
begin = begin->m_pNext;
}
printf("\n");
}
//测试用例
int main()
{
addListTailNode(&head, 1);
addListTailNode(&head, 2);
addListTailNode(&head, 3);
addListTailNode(&head, 4);
addListTailNode(&head, 5);
addListTailNode(&head, 6);
PrintList(&head);
//删除中间结点
struct ListNode* find = findDelNode(&head, 4);
DeleteNode(&head, find);
PrintList(&head);
//删除头结点
struct ListNode* find2 = findDelNode(&head, 1);
DeleteNode(&head, find2);
PrintList(&head);
//删除尾结点
struct ListNode* find3 = findDelNode(&head, 6);
DeleteNode(&head, find3);
//PrintList(&head);
return 0;
}
结果如下图:(尾节点删除后未打印,可以通过窗口查看此结点已经删除,解决方法上述函数处)