目录
解题关键:先节点pre
假设链表为pre->cur->next,cur是你要删除的节点,
必须记住pre的位置!
solution1 单指针:用pre去遍历
头节点head没有先结点pre,所以单独讨论
/**
* 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->val == val) return head->next;
ListNode* pre = head;
while((pre->next != NULL) && (pre->next->val != val)) {
pre = pre->next;
}
if(pre->next->val == val) {
pre->next = pre->next->next;
}
return head;
}
};
solution2 双指针:用cur去遍历,实时更新pre
和s1思路几乎一致
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val) {
if(head->val == val) return head->next;
ListNode* pre = head;
ListNode* cur = pre->next;
while((cur->val != val) && (cur != NULL)) {
pre = cur;
cur = cur->next;
}
if(cur->val == val) {
pre->next = cur->next;
}
return head;
}
};
无需对头节点head作特殊判断:创建拥有虚假头节点的新链表
我们给头节点head加上一个虚假的先节点dummyHead即可
此处“新链表”这个想法很重要,因为假设删除的是头节点,写“return head”会出问题。但是如果你记住了新链表、虚假头节点,那么你很容易推得我们要返回的真实头节点就是虚假头节点的下一个节点,写“return dummyHead->next”正确
引入虚假头节点的优势在于,代码中不需要对头节点作特殊判断,可以节省一些时间
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val) {
ListNode* dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode* pre = dummyHead;
while((pre->next != NULL) && (pre->next->val != val)) {
pre = pre->next;
}
if(pre->next->val == val) {
pre->next = pre->next->next;
}
return dummyHead->next;//此处如果return head就会出错,假设删除的是头节点呢?
}
};