[LeetCode] 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

/**
 * 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) {
        ListNode n(0);
        n.next = head;
        ListNode *p = &n;
        while(p->next )
        {
            //Note: to handle duplication
            if(p->next->val == val) 
            {
                ListNode *t = p->next;
                p->next = p->next->next;
                delete t;
            }
            else p = p->next;
        }
        
        return n.next;
    }
};