面试题18(一):在O(1)时间删除链表结点
题目:给定单向链表的头指针和一个结点指针,定义一个函数在O(1)时间删除该结点。
解题思路:要删除的结点不是尾结点,将该节点的下一个结点赋值给该节点,删除下一个节点。 链表只有一个结点,删除头结点(也是尾结点)。 链表中有多个结点,删除为尾结点,则找到该节点的前一个节点。
void DeleteNode(ListNode** pListNode, ListNode* pToBeDeleted)
{
if (!pListNode || !pToBeDeleted)
return;
if (pToBeDeleted->m_pNext != nullptr)
{
ListNode* pNext = pToBeDeleted->m_pNext;
pToBeDeleted->m_nValue = pNext->m_nValue;
pToBeDeleted->m_pNext = pNext->m_pNext;
delete pNext;
pNext = nullptr;
}
else if (*pListNode = pToBeDeleted)
{
delete pToBeDeleted;
pToBeDeleted = nullptr;
}
else
{
ListNode* pNode = *pListNode;
while (pNode->m_pNext != pToBeDeleted)
{
pNode = pNode->m_pNext;
}
pNode->m_pNext = nullptr;
delete pToBeDeleted;
pToBeDeleted = nullptr;
}
}