-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathremove_linked_list_elements.cpp
90 lines (83 loc) · 1.88 KB
/
remove_linked_list_elements.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
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/*
* =====================================================================================
*
* Filename: remove_linked_list_elements.cpp
*
* Description: 203. Remove Linked List Elements. Remove all elements from a linked
* list of integers that have value val.
*
* Version: 1.0
* Created: 02/25/19 03:21:52
* Revision: none
* Compiler: gcc
*
* Author: Zhu Xianfeng (), [email protected]
* Organization:
*
* =====================================================================================
*/
#include <stdio.h>
#include <stdlib.h>
struct ListNode
{
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
// Iterative
class Solution1
{
public:
ListNode* removeElements(ListNode* head, int val)
{
ListNode fake(0);
ListNode* last = &fake;
while (head != NULL)
{
if (head->val == val)
{
ListNode* ptr = head;
head = head->next;
delete ptr;
}
else
{
last->next = head;
last = head;
head = head->next;
last->next = NULL;
}
}
return fake.next;
}
};
// Recursive
class Solution2
{
public:
ListNode* removeElements(ListNode* head, int val)
{
if (head == NULL)
{
return head;
}
if (head->val == val)
{
ListNode* ptr = head->next;
delete head;
return removeElements(ptr, val);
}
else
{
head->next = removeElements(head->next, val);
return head;
}
}
};
using Solution = Solution2;
int main(int argc, char* argv[])
{
ListNode* head = NULL;
head = Solution().removeElements(head, 10);
return 0;
}