递归写法
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if(head == nullptr) {
return nullptr;
}
if(head->val == val) {
return removeElements(head->next, val);
}
head->next = removeElements(head->next, val);
return head;
}
};
非递归写法,使用哨兵移动的双指针技巧。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* dummy = new ListNode(-1);
dummy->next = head;
auto p = dummy;
while (p != nullptr) {
auto q = p->next;
while(q != nullptr && q->val == val) {
q = q->next;
}
p->next = q;
p = p->next;
}
return dummy->next;
}
};