Код выдаёт некоторые ошибки (прикрепили, на картинке):
Что исправить?
| 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
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
| #include "StdAfx.h"
#ifndef __list
#define __list
template <class SC> class List
{
struct Element
{
SC data;
Element *next;
Element *prev;
};
private:
Element *Head;
Element *Curr;
public:
int length;
List();
List (SC x);
List(const List<SC> &C);
~List();
void init();
void push(SC data);
SC pop();
void delFromData(SC adr);
void loop();
void clear();
void next();
void prev();
int isNoEmpty();
SC lp();
void operator +(SC v);
void sort();
void past(List<SC> &a);
};
#endif
template <class SC> List()
{
Head =NULL;
Curr=NULL;
length=0;
}
template <class SC> List (SC x)
{
Head=NULL;
Curr=NULL;
length=0;
push(x);
}
template <class SC> List(const List<SC> &C)
{
this->Head=NULL;
this->Curr=NULL;
this->length=0;
Element *p=C.Curr;
for(int i=0;i<C.length;i++)
{
push(p->data);
p=p->next;
}
}
template <class SC> ~List()
{
clear();
}
template <class SC> void init()
{
Curr=Head;
}
template <class SC> void delFromData(SC adr)
{
if(isNoEmpty())
{
Element *tmp=Curr;
for(int i=0;i<length;i++)
{
if(Curr->data==adr)
{
if(Curr==tmp)
tmp=tmp->next;
pop();
}
next();
}
Curr=tmp;
}
}
template <class SC> void next()
{
if(isNoEmpty())
Curr=Curr->next;
}
template <class SC> void prev()
{
if(isEmpty())
Curr=Curr->prev;
}
template <class SC> int isNoEmpty()
{
if (Curr==NULL )
return 0;
else
return 1;
}
template <class SC> SC lp()
{
if(isNoEmpty())
return Curr->data;
else
return 0;
}
template <class SC> void List<SC>:: push (SC data)
{
Element *inserted;
inserted= new Element;
inserted->data=data;
if (!isNoEmpty())
{
Head=inserted;
Curr=inserted;
Curr->next=inserted;
Curr->prev=inserted;
}
else
{
inserted->next=Curr->next;
inserted->next->prev=inserted;
Curr->next=inserted;
inserted->prev=Curr;
}
length++;
Curr=inserted;
}
template <class SC> SC List<SC>::pop ()
{
SC tag;
if (!isNoEmpty()) return 0;
Element *temp=Curr;
tag=temp->data;
if (length==1)
{
Head=NULL;
Curr=NULL;
}
else
{
Curr->next->prev=Curr->prev;
Curr->prev->next=Curr->next;
Curr=Curr->next;
}
if(temp==Head)
Head=Head->next;
length--;
delete temp;
return tag;
}
template <class SC> void List<SC>::loop()
{
if (isNoEmpty())
{
Element *tempCar=Head;
for (int i=0;i<length;i++)
{
cout <<tempCar->data <<" ";
tempCar=tempCar->next ;
}
cout << "\n";
}
else
cout<< "List is empty\n";
}
template <class SC> void List<SC>::clear()
{
for(int i=0;i<length;)
pop();
}
template <class SC> void List<SC>::operator + (SC v)
{
push(v);
}
template <class SC> void List<SC>::sort()
{
SC Temp;
int i,j;
for (j=0;j<length-1;j++)
{
init();
for(i=0;i<length-1;i++)
{
if(Curr->data > Curr->next->data)
{
Temp=pop();
next();
push(Temp);
}
else
next();
}
i=0;
}
}
template <class SC> void List<SC>::past(List<SC> &a)
{
init();
a.init();
int i;
for(i=0;i<a.length;)
{
if(a.Curr->data<Curr->data)
{
prev();
push(a.Curr->data);
a.next();
next();
i++;
}
else
next();
}
} |
|
(
