LeetCode-Solution/LeetCode203.cpp at main · nfpranta/LeetCode-Solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
 *Definition for singly-linked list.
 *struct ListNode {
 *int val;
 *ListNode * next;
 *ListNode() : val(0), next(nullptr) {}
 *ListNode(int x) : val(x), next(nullptr) {}
 *ListNode(int x, ListNode *next) : val(x), next(next) {}
 *};
 */
class Solution
{
public:
    ListNode *removeElements(ListNode *head, int val)
    {
        ListNode *temp = new ListNode();
        temp->next = head;
        ListNode *node = temp;
        while (node->next != nullptr)
        {
            if (node->next->val != val)
            {
                node = node->next;
            }
            else
            {
                ListNode *tmp = node->next;
                node->next = node->next->next;
                delete (tmp);
            }
        }
        return temp->next;
    }
};