Repository navigation
Expand file tree
/
Copy pathdynamic-array.c
More file actions
95 lines (84 loc) · 1.99 KB
/
Copy pathdynamic-array.c
File metadata and controls
95 lines (84 loc) · 1.99 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
#include <stdio.h>
#include <stdlib.h>
int statusCode = 0;
typedef struct {
int size;
int used;
int *list;
} List;
List getList() {
int *array = (int *)malloc(sizeof(int) * 10);
List list = {10, 0, array};
return list;
}
void append(List *list, int value, int index) {
if (index >= list->used) {
list->list[list->used] = value;
} else {
for (int i = list->used - 1; i >= index; i--) {
list->list[i + 1] = list->list[i];
}
list->list[index] = value;
}
list->used++;
if (list->used >= list->size) {
int oldSize = list->size;
list->size *= 1.5;
int *newArray = (int *)malloc(sizeof(int) * list->size);
if (newArray == NULL) {
statusCode = 1;
return;
}
for (int i = 0; i < oldSize; i++) {
newArray[i] = list->list[i];
}
free(list->list);
list->list = newArray;
list->list[oldSize + 1] = value;
return;
}
}
int delete(List *list, int index) {
if (index >= list->used) {
statusCode = 1;
return -1;
}
int value;
if (index == list->used - 1) {
value = list->list[index];
list->list[index] = 0;
list->used--;
return value;
}
value = list->list[index];
for (int i = index; i < list->used; i++) {
list->list[i] = list->list[i + 1];
}
list->used--;
list->list[list->used] = 0;
return value;
}
int main(int argc, char *argv[]) {
List myList = getList();
append(&myList, 4, 9); // list size: 10
append(&myList, 6, 9);
append(&myList, 9, 0);
append(&myList, 9, 0);
append(&myList, 6, 0);
append(&myList, 5, 0);
append(&myList, 8, 0);
append(&myList, 6, 0);
append(&myList, 2, 0);
append(&myList, 3, 0);
append(&myList, 3, 0); // list size: 15
append(&myList, 3, 0);
append(&myList, 3, 0);
append(&myList, 3, 0);
append(&myList, 3, 0);
append(&myList, 3, 0); // list size: 22
printf("%d", delete (&myList, 0));
printf("%d", delete (&myList, 0));
printf("%d", delete (&myList, 9));
printf("\n%d", myList.size); // prints 22
return statusCode;
}