题目:
删除链表中等于给定值 val 的所有节点。
示例:
输入: 1->2->6->3->4->5->6, val = 6
输出: 1->2->3->4->5
思路:
方法一:设置一个pre结点,指向当前结点的前一个结点,需要判断是否为头结点,进行不同的处理;见下方代码
方法二:类似方1,设置一个哨兵结点(伪头结点),这样每一个结点都有pre结点了,不需要情况讨论;代码2:
代:1:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void removeNode(ListNode* pre, ListNode* p)
{
pre->next = p->next;
}
ListNode* removeElements(ListNode* head, int val) {
ListNode* p = head, *pre = head;
while(p){
if(p->val == val){ // 如果val符合
if(p == head)
head = p->next;
else
removeNode(pre, p);
// 调整指针位置;
p = p->next;
}
else { // 如果val不符合
pre = p;
p = p->next;
}
}
return head;
}
};
代码2:
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* sentinel = new ListNode(0);
sentinel->next = head;
ListNode *prev = sentinel, *curr = head, *toDelete = nullptr;
while (curr != nullptr) {
if (curr->val == val) {
prev->next = curr->next;
toDelete = curr;
} else prev = curr;
curr = curr->next;
if (toDelete != nullptr) {
delete toDelete;
toDelete = nullptr;
}
}
ListNode *ret = sentinel->next;
delete sentinel;
return ret;
}
};