blob: 1b47d99580fa824c0f7a1bc94a02cc8d44ba4c22 (
plain) (
blame)
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
|
#ifndef SINGLY_LINKED_LIST_HPP
#define SINGLY_LINKED_LIST_HPP
struct ListNode {
int _data = 0;
ListNode* _next = nullptr;
};
struct SinglyLinkedList {
size_t _size;
ListNode* _head = nullptr;
};
//SinglyLinkedList singlylinkedlist{};
//ListNode listnode{};
//
//listnode._data = 1;
//singlylinkedlist._head = &listnode;
bool Append(SinglyLinkedList* list, ListNode* node) {
//if empty
if (list->_size == 0)
{
list->_head = node;
list->_size++;
return true;
}
//if not empty
ListNode* travel = nullptr;
for (travel = list->_head; travel->_next != nullptr;)
{
travel = travel->_next;
}
travel->_next = node;
return true;
}
bool Prepend(SinglyLinkedList* list, ListNode* node) {
//if empty
if (list->_size == 0)
{
list->_head = node;
list->_size++;
return true;
}
//if not empty
ListNode* travel = list->_head;
list->_head = node;
node->_next = travel;
return true;
}
bool RemoveFirst(SinglyLinkedList* list) {
if (list->_size == 0)
return false;
ListNode* first = list->_head;
list->_head = list->_head->_next;
list->_size--;
delete first;
return true;
}
bool RemoveLast(SinglyLinkedList* list) {
if (list->_size == 0)
return false;
/*if (list->_size == 1)
{
delete list->_head;
list->_head = nullptr;
list->_size--;
return true;
}
*/
ListNode* SecondToLast = list->_head;
while (SecondToLast->_next->_next != nullptr)
{
SecondToLast = SecondToLast->_next;
}
delete SecondToLast->_next;
SecondToLast->_next = nullptr;
list->_size--;
return true;
}
#endif
|