-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinked_list.h
More file actions
48 lines (43 loc) · 1.03 KB
/
linked_list.h
File metadata and controls
48 lines (43 loc) · 1.03 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
#ifndef CPP_ALGORITHM_LINKED_LIST_H
#define CPP_ALGORITHM_LINKED_LIST_H
#include <memory>
namespace LinkedList
{
/**
* \brief A singly-linked list node.
* \tparam T the type of the data stored in the node
*/
template <typename T>
struct Node
{
T data;
std::shared_ptr<Node<T>> next;
};
/**
* \brief Append a node to the end of a linked list.
* \param node the head of the list
* \param tail the tail of the list
*/
inline void AppendNode(std::shared_ptr<Node<int>>* node, std::shared_ptr<Node<int>>* tail)
{
(*tail)->next = *node;
*tail = *node;
*node = (*node)->next;
}
/**
* \brief Return by calculating the length of the list.
* \param list the head of the list
* \return length of list
*/
inline auto Length(std::shared_ptr<Node<int>> list) -> int
{
auto length = 0;
while (list)
{
++length;
list = list->next;
}
return length;
}
}
#endif