Remove all elements from a linked list of integers that have value val.
Example
Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6
Return: 1 –> 2 –> 3 –> 4 –> 5
Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if (head == NULL) return head;
ListNode dummy(-1);
dummy.next = head;
for (ListNode *prev = &dummy, *cur = head; cur; cur = cur->next) {
if (cur->val == val) {
prev->next = cur->next;
delete cur;
}
else {
prev = cur;
}
}
return dummy.next;
}
};