using System using System Collections Generic using System Linq namesp

  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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
using System;
using System.Collections.Generic;
//using System.Linq;
namespace ListLibrary
{
public class SublistNotFoundException: System.Exception
{
}
public class Node
{
public int Value;
public Node Next = null;
public Node(int value) : this(value, null) { }
public Node(int value, Node next)
{
Value = value;
Next = next;
}
}
public class MyList
{
public Node Head;
public MyList Next;
public MyList() : this(null)
{
}
public MyList(Node head, MyList next = null)
{
Head = head;
Next = next;
}
public int Count {
get {
int res = 0;
Node currentElement = Head;
while (currentElement != null) {
currentElement = currentElement.Next;
res++;
}
/*
Node currentElement = Head;
if (currentElement == null)
return 0;
int res = 1;
while (currentElement.Next != null) {
currentElement = currentElement.Next;
res++;
}*/
return res;
}
set {;}
}
public Node this[int key]
{
get {
Node element = Head;
int i = 0;
while ((i < key) && (element.Next != null)) {
i++;
element = element.Next;
}
return element;
}
set {;}
}
public bool Equals(List<int> list)
{
if (Count != list.Count)
return false;
Node currentElement = Head;
foreach (var el in list) {
if (currentElement.Value != el)
return false;
currentElement = currentElement.Next;
}
return true;
}
public MyList Clone()
{
if (Head == null)
return new MyList ();
Node newHead = new Node (Head.Value, Head.Next);
Node currentNode = newHead;
Node currentOldNode = Head;
while (currentOldNode.Next != null) {
Node newNode = new Node (currentOldNode.Next.Value, currentOldNode.Next.Next);
currentOldNode = currentOldNode.Next;
currentNode.Next = newNode;
currentNode = newNode;
}
return new MyList(newHead);
}
}
public class MyListOfLists
{
public MyList Head;
public MyListOfLists() : this(null)
{
}
public MyListOfLists(MyList head)
{
Head = head;
}
public MyList this[int key]
{
get {
MyList list = Head;
int i = 0;
while ((i < key) && (list.Next != null)) {
i++;
list = list.Next;
}
return list;
}
set {;}
}
public int Count {
get {
int res = 0;
MyList tail = Head;
while (tail != null) {
res++;
tail = tail.Next;
}
return res;
}
set {;}
}
public void Add(MyList list)
{
MyList tail = Head;
if (tail == null)
Head = list;
else {
while (tail.Next != null)
tail = tail.Next;
tail.Next = list;
}
}
public int FindIndex(List<int> subList)
{
MyList currentList = Head;
if (currentList == null)
return -1;
int index = 0;
do{
if (currentList.Equals (subList))
return index;
index++;
currentList = currentList.Next;
} while (currentList != null);
return -1;
}
public void DeleteList(List<int> subList)
{
DeleteListByIndex (FindIndex (subList));
}
public void DeleteListByIndex(int index)
{
MyList currentList = Head;
if (currentList == null)
throw new SublistNotFoundException();
if (index == 0)
Head = currentList.Next;
for (int i = 0; i < index - 1; i++) {
if (currentList.Next == null)
throw new SublistNotFoundException();
currentList = currentList.Next;
}
currentList.Next = currentList.Next.Next;
}
public void InsertListByIndex(int index, MyList list)
{
if (index == 0) {
list.Next = Head;
Head = list;
return;
}
MyList currentList = Head;
for (int i = 0; i < index - 1; i++) {
if (currentList == null)
throw new SublistNotFoundException();
currentList = currentList.Next;
}
list.Next = currentList.Next;
currentList.Next = list;
}
public void Concatenate (MyListOfLists second) {
if (Head == null) {
Head = second.Head;
} else {
MyList tail = Head;
while (tail.Next != null)
tail = tail.Next;
tail.Next = second.Head;
}
}
public void SplitByElement(int el, out MyListOfLists secondListOfLists)
{
secondListOfLists = new MyListOfLists ();
MyList currentList = Head;
while (currentList != null) {
MyList secondList = new MyList ();
secondListOfLists.Add (secondList);
Node currentNode = currentList.Head;
if (currentNode == null) {
// ничего
} else if (currentNode.Value == el) {
currentList.Head = null;
secondList.Head = currentNode.Next;
} else {
while (currentNode.Next != null) {
if (currentNode.Next.Value == el) {
secondList.Head = currentNode.Next.Next;
currentNode.Next = null;
break;
}
currentNode = currentNode.Next;
}
}
currentList = currentList.Next;
}
}
public MyListOfLists Clone()
{
if (Head == null)
return new MyListOfLists ();
MyList newHead = new MyList (Head.Head, Head.Next);
MyList currentList = newHead;
MyList currentOldList = Head;
while (currentOldList.Next != null) {
MyList newList = currentOldList.Next.Clone();
newList.Next = currentOldList.Next.Next;
currentOldList = currentOldList.Next;
currentList.Next = newList;
currentList = newList;
}
return new MyListOfLists(newHead);
}
}
}