LeetCode Remove Linked List Elements

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
 // 9:33
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode dummyHead(0);
        dummyHead.next = head;
        ListNode* pre = &dummyHead;
        ListNode* cur = dummyHead.next;
        
        while (cur != NULL) {
            if (cur->val == val) {
                ListNode* del = cur;
                cur = cur->next;
                pre->next = cur;
                delete del;
            } else {
                pre = cur;
                cur = cur->next;
            }
        }
        return dummyHead.next;
    }
};