blob: c0915e7a011e09a0bf3751ecf260cd8369fc4d77 (
plain)
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
#include<iostream>
using namespace std;
template<typename T>
struct node {
T value;
node* next;
};
template<typename T>
class list {
public:
list() : _head{nullptr} {}
~list() {
while(_head != nullptr) {
node<T>* tmp = _head->next;
delete tmp;
_head = tmp;
}
}
list* push_front(T val) {
_head = new node<T>{val, _head};
return this;
}
list* push_back(T val) {
node<T>* iter = _head;
if(_head == nullptr) {
_head = new node<T>{val, nullptr};
} else {
while(iter->next != nullptr) {
iter = iter->next;
}
iter->next = new node<T>{val, nullptr};
}
return this;
}
list* push_after_value(T val, T newval) {
node<T>* iter = _head;
while(iter && iter->value != val)
iter = iter->next;
if(iter == nullptr)
return this->push_front(newval);
iter->next = new node<T>{newval, iter->next};
return this;
}
list* push_before_value(T val, T newval) {
node<T>* iter = _head;
while(iter && iter->next && iter->next->value != val)
iter = iter->next;
if(iter == nullptr)
return this->push_front(newval);
iter->next = new node<T>{newval, iter->next};
return this;
}
void print() {
node<T>* iter = _head;
while(iter != nullptr) {
cout << iter->value << ' ';
iter = iter->next;
}
}
private:
node<T>* _head;
};
int main() {
list<double>* l = new list<double>{};
l->push_front(2)->push_front(1.7);
// 1.7 2
l->push_back(5.2);
// 2 1.7 5.2
l->push_back(10.1)->push_back(15);
// 2 1.7 5.2 10.1 15
l->push_after_value(5.2, 6.4);
// 2 1.7 5.2 6.4 10.1 15
l->push_before_value(5.2, 4.1);
// 2 1.7 4.1 5.2 6.4 10.1 15
l->push_before_value(4.1, 3.0);
// 2 1.7 3.0 4.1 5.2 6.4 10.1 15
l->print();
return 0;
}
|
