[leetcode 203] Remove Linked List Elements

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.

Subscribe to see which companies asked this question

Solution:

struct ListNode* removeElements(struct ListNode* head, int val)
{
struct ListNode dummy;
struct ListNode* p = &dummy;
dummy.next = head;

while (p->next != NULL)
{
if (p->next->val == val) // find, delete it
{
p->next = p->next->next;
}
else // go on
{
p = p->next;
}
}

return dummy.next;
}