203. Remove Linked List Elements

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ // This node has some memory leak class Solution { public: ListNode* removeElements(ListNode* head, int val) { // zero node if (head == nullptr) return head; // one node if (head->next == nullptr){ if (head->val == val){ head = nullptr; } return head; } // >= 2 nodes ListNode * curr = head; while(curr->next-> != nullptr){ if (curr->next->val == val){ curr->next = curr->next->next; } curr = curr->next; } return head; } };