-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRemoveGivenElement.cpp
More file actions
62 lines (60 loc) · 1.24 KB
/
Copy pathRemoveGivenElement.cpp
File metadata and controls
62 lines (60 loc) · 1.24 KB
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <bits/stdc++.h>
using namespace std;
struct ListNode
{
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
ListNode() : val(0), next(nullptr) {}
ListNode(int x, ListNode *next) : val(x), next(next) {}
};
class Solution
{
public:
ListNode *removeElements(ListNode *head, int val)
{
while (head && head->val == val)
{
head = head->next;
}
ListNode *current = head, *prev = head;
while (current)
{
if (current->val == val)
{
prev->next = current->next;
current = current->next;
}
else
{
prev = current;
current = current->next;
}
}
return head;
}
};
class Solution
{
public:
ListNode *removeElements(ListNode *head, int val)
{
if (!head)
{
return NULL;
}
ListNode **prev = &head;
while (*prev)
{
if ((*prev)->val == val)
{
*prev = (*prev)->next;
}
else if (*prev)
{
prev = &(*prev)->next;
}
}
return head;
}
};