思路:开一个头结点,方便处理
/**
* 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* dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode* p = dummyHead;
while(p->next != nullptr){
if(p->next->val == val){
ListNode* t = p->next;
p->next = t->next;
delete t;
}
else{
p = p->next;
}
}
head = dummyHead->next;
delete dummyHead;
return head;
}
};