Всем здравия.
В двусвязанном списке нужно удалить выбранный элемент. Упорно косячу на этом моменте, постоянно ошибка. Может, кто подскажет.
Собственно, весь код: (косячит процедура DelList)
| C++ |
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
| #include <iostream>
#include <string>
#include <locale>
struct Node{
int idNumber;
std::string slugachiy;
Node *next;
Node *prev;
};
class MyList{
private:
Node *head, *latest;
bool sorted, testMode;
void sortList();
public:
MyList();
void addNextNode(int idnum, std::string slugach);
void printList();
void DelList(int itemNo);
};
int inputValMainMenu();
void inputValList(MyList &test);
void MyList::DelList(int itemNo)
{
Node *current;
current = head;
while (current->next != latest)
{
if (current->idNumber = itemNo)
{
if (current->next!=NULL)
{
current->prev->next=current->next;
current->next->prev=current->prev; // --- тут выкидывает ошибку
} else
{
(current)->prev=NULL;
latest=(latest->prev);
}
}
current=current->next;
}
}
int main()
{
setlocale(0,"Rus");
MyList test;
int n = 0;
int m = 0;
while(true){
m = inputValMainMenu();
if (m == 0)
return 0;
else if (m == 1)
inputValList(test);
else if (m == 2)
test.printList();
else
{
std::cout<<"Код удаляемой записи:"<<std::endl;
std::cin>>n;
test.DelList(n);
}
}
return 0;
}
int inputValMainMenu(){
int n = 0;
while(true){
std::cout<<std::endl<<"Выберите:"<<std::endl;
std::cout<<"0 - для выхода."<<std::endl;
std::cout<<"1 - для внесения служащих."<<std::endl;
std::cout<<"2 - для просмотра служащих."<<std::endl;
std::cout<<"3 - для удаления."<<std::endl<<std::endl;
std::cin>>n;
if(n!=0 && n!=1 && n!=2 && n!=3){
std::cout<<"Неверное значение."<<std::endl;
continue;
}
return n;
}
}
void inputValList(MyList &test){
int idnum,m;
std::string slugach;
while (true) {
std::cout<<std::endl<<"Введите код: ";
std::cin>>idnum;
std::cout<<std::endl<<"Введите фамилию служащего: ";
std::cin>>slugach;
test.addNextNode(idnum,slugach);
std::cout<<std::endl<<"Продолжить ввод служащих? (1 - да, 2 - нет) ";
std::cin>>m;
if (m != 1)
return;
}
}
MyList::MyList(){
head = new Node;
latest = new Node;
head->prev = NULL;
head->next = latest;
latest->prev= head;
latest->next= NULL;
sorted = false;
testMode = false;
}
void MyList::sortList(){
sorted = true;
Node *current = head;
Node *tmp = NULL;
Node *tmpNext = NULL;
Node *tmpPrev = NULL;
while(current->next != latest){
if (current == head){
current = current->next;
continue;
}
if (current->slugachiy>current->next->slugachiy){
tmp = current;
tmpNext = current->next->next;
tmpPrev = current->prev;
current = tmpNext->prev;
current->prev = tmpPrev;
current->prev->next = current;
current->next = tmp;
current->next->prev = current;
current->next->next = tmpNext;
current->next->next->prev = tmp;
if (tmp->prev == head){
current->prev = head;
head->next = current;
}
current = current->prev;
}
else{
current = current->next;
}
}
}
void MyList::printList(){
if (!sorted)
sortList();
Node *current = head;
if (current->next == latest){
std::cout<<"Список пуст."<<std::endl;
return;
}
while(current->next != latest){
current = current->next;
std::cout<<"Код: "<<current->idNumber<<" - Служащий: "<<current->slugachiy<<" "<<std::endl;
}
}
void MyList::addNextNode(int idnum, std::string slugach){
sorted = false;
Node *nd = new Node;
nd->idNumber = idnum;
nd->slugachiy = slugach;
nd->next = NULL;
nd->prev = NULL;
if (head->next == latest){
head->next = nd;
latest->prev = nd;
nd->prev = head;
nd->next = latest;
}
else{
Node *current = head;
while(current->next != latest){
current = current->next;
}
current->next = nd;
latest->prev = nd;
nd->prev = current;
nd->next = latest;
}
} |
|
(
