O(1)时间删除单链表节点

void DeleteNode(ListNode** pHead, ListNode* pDelete)
{
	if (!pHead || !pDelete)
		return;

	if (pDelete->pNext != NULL)
	{
		ListNode* next = pDelete->pNext;
		pDelete->nValue = next->nValue;
		pDelete->pNext = next->pNext;

		delete next;
		next = NULL;
	}
	else if (*pHead == pDelete)
	{
		delete pDelete;
		pDelete = NULL;
		*pHead = NULL;
	}
	else
	{
		ListNode* node = *pHead;
		while (node != pDelete)
		{
			node = node->pNext;
		}
		node->pNext = NULL;
		delete pDelete;
		pDelete = NULL;
	}
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值