-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathList.cpp
More file actions
250 lines (240 loc) · 4.2 KB
/
List.cpp
File metadata and controls
250 lines (240 loc) · 4.2 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
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
#include <iostream>
#include <cstdlib>
#include <conio.h>
struct Node
{
int value;
Node* next;
};
Node* make_list()
{
int b;
Node* current { new Node};
std::cout << "Input first element ";
std::cin >> b;
current->value = b;
current->next = nullptr;
return current;
}
void add_element_any (Node* front,int num)
{
Node* current{new Node};
current->value=num;
Node* temp=front;
while (temp->next->value<num)
{
temp=temp->next;
}
current->next=temp->next;
temp->next=current;
}
void add_element_last(Node* front,int num)
{
Node* last{front};
Node* current{new Node};
current->value=num;
current->next=nullptr;
while (last->next!=nullptr)
{
last=last->next;
}
last->next=current;
}
Node* add_element_front(Node* front,int num)
{
Node* current { new Node};
current->value = num;
current->next = front;
return current;
}
Node* add_element_switch(Node* front,int num)
{
Node* temp {front};
if ((temp->next==nullptr)&&(temp->value==num)||(front->value==num))
{
std::cout << "ERROR element already exists ";
return front;
}
while (temp->next != nullptr)
{
temp = temp->next;
if (temp->value == num)
{
std::cout << "ERROR element already exists ";
return front;
}
}
if (front->value > num)
{
return add_element_front(front, num);
}
else
while (temp->next != nullptr)
{
temp = temp->next;
}
if (temp->value < num)
{
add_element_last(front, num);
return front;
}
else
{
add_element_any(front, num);
return front;
}
}
Node* del_front(Node* front)
{
Node* temp {front->next};
delete front;
return(temp); // íîâûé êîðåíü ñïèñêà
}
Node* del_element(Node *front)
{
Node* temp {front};
Node* current;
int a;
std::cout << "Input value to del ";
std::cin >> a;
if ((temp==front) &&(temp->value==a))
{
return del_front(temp);
}
while ((temp->next->value != a) && (temp->next != nullptr))
{
temp = temp->next;
}
if (temp->next == nullptr)
{
current = temp;
delete current;
return front;
}
else {
current = temp->next;
temp->next = current->next;
delete current;
return front;
}
}
void del_all(Node* front)
{
Node* temp {front};
Node* current;
while (temp->next != nullptr)
{
temp = temp->next;
if (temp->next==nullptr)
{
current = temp;
delete current;
return;
}
else
{
current = temp->next;
temp->next = current->next;
delete current;
}
}
}
void output_list(Node* front)
{
for (Node* current{front}; current != nullptr; current = current->next)
{
std::cout << current->value << " ";
}
std::cout << std::endl;
}
void clear()
{
std::cout << "\x1B[2J\x1B[H";
}
int main()
{
Node* front {new Node};
auto a = 0;
auto b = 0;
while (a != 7)
{
std::cout << "1 Make list (1 element)" << std::endl << "2 add element" << std::endl << "3 del element"
<< std::endl;
std::cout << "4 del all" << std::endl << "5 Output list" << std::endl << "6 end work and exit" << std::endl;
std::cout << "Select ";
std::cin >> a;
switch (a)
{
case 1:
if (b==0)
{
front = make_list();
b = 1;
}else
{
std::cout << "List is created";
}
break;
case 2:
if (b == 0)
{
std::cout << "List not create";
break;
}
else
{
int num;
std::cout << "Enter element";
std::cin >> num;
front = add_element_switch(front,num);
}
break;
case 3:
if (b == 0)
{
std::cout << "List not create";
break;
}
else
{
output_list(front);
front=del_element(front);
if (front==nullptr)
{
b = 0;
}
}
break;
case 4:
if (b == 0)
{
std::cout << "List not create";
break;
}
else
{
del_all(front);
}
b = 0;
break;
case 5:
if (b == 0)
{
std::cout << "List not create";
break;
}
else { output_list(front); }
break;
case 6: if(b==1) del_all(front);
a=7;
break;
default:
break;
}
std::cout << std::endl << "Press any key to continue " << std::endl;
//getchar();
_getch();
//clear();
system("cls");
}
}