/**
* 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) {
auto dummy = new ListNode(0);
dummy->next = head;
auto curr = dummy;
while (curr->next) {
if (curr->next->val == val) {
curr->next = curr->next->next;
} else {
curr = curr->next;
}
}
head = dummy->next;
return head;
}
};