1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
|
struct Element {
int data;
Element* next;
};
struct LinkedList {
Element* head;
int size;
};
void split(LinkedList* l, int v, LinkedList** a, LinkedList**b) {
//suche nach v
Element*c = l->head;
if (c->data == v) {}
else {
for (int i = 0; i < l->size; i++) {
c = c->next;
if (c->data == v) {
break;
}
}
|