-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path203.cpp
35 lines (31 loc) · 830 Bytes
/
203.cpp
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
#include <iostream>
#include <vector>
using namespace std;
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) {}
};
ListNode* removeElements(ListNode* head, int val) {
ListNode* tmp;
ListNode* dummy = new ListNode(0, head);
ListNode* current = dummy;
while (current->next) {
if (current->next->val == val) {
tmp = current->next;
current->next = current->next->next;
delete tmp;
}
else {
current = current->next;
}
}
return dummy->next;
}
int main() {
ListNode* head = new ListNode(1, new ListNode(2, new ListNode(3, nullptr)));
removeElements(head, 2);
return 0;
}