Calculator/List.h at master · InnetaSh/Calculator · GitHub

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
#pragma once
#include<iostream>
using namespace std;
template<typename T>
class List
{
	struct Node
	{
		T num;
		Node* next;
	};
	Node* head;
public:
	List();
	~List();
	void appenNode(T);
	void printList();
	void deleteNode(T);
	void deleteFirst();
	void insertNode(T);
};

template<typename T>
List<T>::List()
{
	this->head = nullptr;
}

template<typename T>
List<T>::~List()
{
	Node* nodePtr = head;
	Node* nextNode;
	while (nodePtr != nullptr)
	{
		nextNode = nodePtr->next;
		delete nodePtr;
		nodePtr = nextNode;
	}
}
template<typename T>
void List<T>::appenNode(T val)
{
	Node* newNode;
	newNode = new Node();
	newNode->num = val;
	newNode->next = nullptr;

	if (head == nullptr)
	{
		head = newNode;
	}
	else
	{
		Node* nodePtr = head;
		while (nodePtr->next != nullptr)
		{
			nodePtr = nodePtr->next;
		}
		nodePtr->next = newNode;
	}
}

template<typename T>
void List<T>::printList()
{
	Node* nodePtr = head;
	while (nodePtr != nullptr)
	{
		cout << nodePtr->num << "\t";
		nodePtr = nodePtr->next;
	}
	cout << "\n";
}

template<typename T>
void List<T>::deleteNode(T val)
{
	Node* nodePtr;
	Node* previusNode = nullptr;
	if (head == nullptr)
		return;
	if (head->num == val)
	{
		nodePtr = head->next;
		delete head;
		head = nodePtr;
	}
	else
	{
		nodePtr = head;
		while (nodePtr != nullptr && nodePtr->num != val)
		{
			previusNode = nodePtr;
			nodePtr = nodePtr->next;
		}
		if (nodePtr != nullptr)
		{
			previusNode->next = nodePtr->next;
			delete nodePtr;
		}
		else
			cout << "Takogo elementa nema.\n";
	}
}

template<typename T>
inline void List<T>::deleteFirst()
{
	if (head == nullptr)
		return;
	Node* nodePtr;
	nodePtr = head->next;
	delete head;
	head = nodePtr;
}

template<typename T>
void List<T>::insertNode(T val)
{
	Node* nodePtr;
	Node* newNode;
	Node* previusNode;

	newNode = new Node;
	newNode->num = val;
	newNode->next = nullptr;

	if (head == nullptr)
		head = newNode;
	else
	{
		nodePtr = head;
		previusNode = nullptr;
		while (nodePtr != nullptr && nodePtr->num < val)
		{
			previusNode = nodePtr;
			nodePtr = nodePtr->next;
		}
		if (previusNode == nullptr)
		{
			head = newNode;
			newNode->next = nodePtr;
		}
		else
		{
			previusNode->next = newNode;
			newNode->next = nodePtr;
		}
	}
}