题目描述:给定单向链表的头指针和一个要删除的节点的值,定义一个函数删除该节点。返回删除后的链表的头节点。
示例 1: 输入: head = [4,5,1,9], val = 5 输出: [4,1,9]
解释: 给定你链表中值为 5 的第二个节点,那么在调用了你的函数之后,该链表应变为 4 -> 1 -> 9.
示例 2: 输入: head = [4,5,1,9], val = 1 输出: [4,5,9]
解释: 给定你链表中值为 1 的第三个节点,那么在调用了你的函数之后,该链表应变为 4 -> 5 -> 9.
1、单指针
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val)
{
if(head == NULL) return head;
if(head->val == val) return head->next;
ListNode* p = head;
while(p->next != NULL && p->next->val != val)
{
p = p->next;
}
if(p->next != NULL)
{
p->next = p->next->next;
}
return head;
}
};
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val)
{
if(head == NULL) return head;
if(head->val == val) return head->next;
ListNode* p = head;
while(p->next != NULL)
{
if(p->next->val == val)
{
p->next = p->next->next;
break;
}
p = p->next;
}
return head;
}
};
2、双指针
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val)
{
if(head == NULL) return head;
if(head->val == val) return head->next;
ListNode *pre = head,*cur = head->next;
while(cur != NULL && cur->val != val)
{
pre = cur;
cur = cur->next;
}
if(cur != NULL)
{
pre->next = cur->next;
}
return head;
}
};
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val)
{
//空链表
if(head == NULL) return head;
//特殊情况处理,删除的节点是头节点
if(head->val == val) return head->next;
//设置双指针,一个指针指向当前的节点,一个指针指向当前节点的下一节点
ListNode *pre = head,*cur = head->next;
//当 cur 为空 或 cur 节点值等于 val 时跳出循环
while(cur != NULL)
{
if(cur->val == val)
{
pre->next = cur->next;
break;
}
pre = cur;
cur = cur->next;
}
// 最后返回链表头节点即可
return head;
}
};