forked from CodersForLife/Data-Structures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedList.cpp
More file actions
157 lines (134 loc) · 2.37 KB
/
Copy pathLinkedList.cpp
File metadata and controls
157 lines (134 loc) · 2.37 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
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
#include <stdlib.h>
#include <cassert>
#include <cstdio>
void append(int element);
void clear(void);
int max(void);
int get(unsigned int position);
void remove_element(unsigned int position);
struct Node
{
int value;
struct Node* next;
};
static struct Node* head = 0;
void append(int element)
{
if (!head)
{
head = (struct Node*)malloc(sizeof(struct Node));
head->value = element;
head->next = 0;
}
else
{
struct Node* iterator = head;
while (iterator->next != 0)
iterator = iterator->next;
iterator->next = (struct Node*)malloc(sizeof(struct Node));
iterator->next->value = element;
iterator->next->next = 0;
}
}
void clear(void)
{
if (head == 0)
return;
struct Node* iterator = head;
struct Node* iterator2;
while (iterator != 0)
{
iterator2 = iterator->next;
free(iterator);
iterator = iterator2;
}
head = 0;
}
int max(void)
{
int max = 0;
for (struct Node* iterator = head; iterator; iterator = iterator->next)
if (iterator->value > max)
max = iterator->value;
return max;
}
int get(unsigned int position)
{
struct Node* iterator = head;
for (int i = 0; i < position; i++)
{
if (!iterator || !iterator->next)
return 0;
iterator = iterator->next;
}
return iterator->value;
}
void remove_element(unsigned int position)
{
struct Node* iterator = head;
struct Node* prev_iterator = head;
for (int i = 0; i < position; i++)
{
if (!iterator || !iterator->next)
return;
prev_iterator = iterator;
iterator = iterator->next;
}
if(position == 0)
{
head = iterator->next;
free(iterator);
}
else
{
iterator = iterator->next;
free(prev_iterator->next);
prev_iterator->next = iterator;
}
}
/////////
//TESTS//
/////////
void max_of_one_element_is_same_element(void)
{
append(5);
assert(max() == 5);
clear();
}
void max_of_three_elements(void)
{
append(3);
append(5);
append(2);
assert(max() == 5);
clear();
}
void get_returns_element_in_position(void)
{
append(3);
append(5);
append(7);
assert(get(2) == 7);
assert(get(0) == 3);
assert(get(500) == 0);
clear();
}
void erasing_elements(void)
{
append(3);
append(5);
append(7);
remove_element(1);
assert(get(0) == 3);
assert(get(1) == 7);
assert(get(2) == 0);
clear();
}
int main (void)
{
max_of_one_element_is_same_element();
max_of_three_elements();
get_returns_element_in_position();
erasing_elements();
printf("All tests passed!\r\n");
}