Update Code

Author: hschoi1104

STL_구현/Single_Linked_List.cpp

@@ -1,122 +1,109 @@
 #include <iostream>
 using namespace std;
-
 template <typename T>
-struct Node {
+class Node {
 public:
-	T value;
-	struct Node<T>* next = nullptr;
+	T val;
+	Node<T>* next;
+	Node() {};
+	~Node() {};
 };
-
 template <typename T>
 class SLL {
 private:
 	Node<T>* head;
 	Node<T>* tail;
-	int size = 0;
+	T size;
 public:
-	SLL() : head(nullptr), tail(nullptr) {}
-	~SLL() {}
-
-	void addNode(T _value) {
-		Node<T>* node = new Node<T>;
-		size++;
-		node->value = _value;
-		node->next = nullptr;
-
+	SLL() :head(nullptr), tail(nullptr), size(0) {};
+	~SLL() {};
+	void AddNode(T _val) {
+		Node<T>* newNode = new Node<T>;
+		newNode->val = _val;
+		newNode->next = nullptr;
 		if (head == nullptr) {
-			head = node;
-			tail = node;
+			head = tail = newNode;
 		}
 		else {
-			tail->next = node;
+			tail->next = newNode;
 			tail = tail->next;
 		}
+		size++;
 	}
-	void removeNode(T _value) {
+	bool Find(T _val) {
 		Node<T>* ptr = head;
-		Node<T>* tmp = ptr;
+		if (!size) return false;
 		while (ptr != nullptr) {
-			if (ptr->value == _value) {
-				break;
-			}
-			else {
-				tmp = ptr;
-				ptr = tmp->next;
-			}
+			if (ptr->val == _val) return true;
+			ptr = ptr->next;
 		}
-		if (ptr != nullptr) {
-			cout << "delete:" << ptr->value << "\n";
-			tmp->next = ptr->next;
+		return false;
+	}
+	void DeleteNode(T _val) {
+		Node<T>* ptr = head;
+		Node<T>* tmp = ptr;
+		if (!size) return;
+		if (size == 1) {
 			delete ptr;
-			size--;
+			head = tail = nullptr;
+			size = 0;
+			return;
 		}
-		else {
-			cout << "delete fail\n";
+		while (ptr!= nullptr) {
+			if (ptr->val == _val) break;
+			tmp = ptr;
+			ptr = ptr->next;
 		}
+		tmp->next = ptr->next;
+		delete ptr;
+		size--;
 	}
-
-	void show() {
+	void Print() {
 		Node<T>* ptr = head;
 		while (ptr != nullptr) {
-			cout << ptr->value << " ";
+			cout << ptr->val << " ";
 			ptr = ptr->next;
 		}
 		cout << "\n";
+		return;
 	}
-	void deleteList() {
-		Node<T>* ptr = head;
-		while (ptr != nullptr) {
-			head = ptr->next;
-			delete ptr;
-			ptr = head;
-		}
-		size = 0;
-	}
-	void addPos(int _index, int _value) {
-		Node<T>* node = new Node<T>;
+	void AddPos(T _pos, T _val) {
+		if (_pos > size) return;
+		Node<T>* newNode = new Node<T>;
+		newNode->val = _val;
+		newNode->next = nullptr;
 		Node<T>* ptr = head;
 		Node<T>* tmp = ptr;
-
-		node->value = _value;
-		node->next = nullptr;
-		for (int i = 0; i < _index; i++) {
+		for (int i = 0; i < _pos; i++) {
 			tmp = ptr;
 			ptr = ptr->next;
 		}
-		tmp->next = node;
-		node->next = ptr;
+		tmp->next = newNode;
+		newNode->next = ptr;
 		size++;
 	}
-	void search(int _value) {
-		Node<T>* ptr = head;
-		int index = 0;
-		while (ptr != nullptr) {
-			if (ptr->value == _value) {
-				cout << index << "¹ø° Á¸Àç\n";
-				break;
-			}
-			ptr = ptr->next;
-			index++;
-		}
-	}
-	int Size() {
-		return size;
-	}
 };
 int main() {
 	SLL<int> sll;
-	sll.addNode(1);
-	sll.addNode(2);
-	sll.addNode(3);
-	sll.addNode(5);
-	sll.addNode(6);
-	sll.show();
-	sll.addPos(3, 4);
-	sll.show();
-	sll.removeNode(2);
-	sll.show();
-	sll.deleteList();
-	sll.show();
+	sll.AddNode(1);
+	sll.AddNode(2);
+	sll.AddNode(3);
+	sll.AddNode(4);
+	sll.AddNode(5);
+	sll.AddNode(6);
+	sll.Print();
+	sll.DeleteNode(3);
+	sll.Print();
+	//cout << (sll.Find(2)) << "\n";
+	sll.DeleteNode(2);
+	sll.Print();
+	sll.DeleteNode(4);
+	sll.Print();
+	sll.DeleteNode(5);
+	sll.Print();
+	sll.DeleteNode(6);
+	sll.Print();
+	sll.DeleteNode(1);
+	sll.Print();
 	return 0;
 }

STL_구현/queue.cpp

@@ -1,58 +1,55 @@
 #include <iostream>
 using namespace std;
+
 template <typename T>
 class Node {
 public:
-	T value;
-	Node* next;
-
-	Node() : value(0), next(nullptr) {};
+	T val;
+	Node<T>* next;
+	Node() {};
 	~Node() {};
 };
+
 template <typename T>
 class Queue {
 private:
 	Node<T>* head;
 	Node<T>* tail;
-	int size;
+	T size;
 public:
 	Queue() :head(nullptr), tail(nullptr), size(0) {};
 	~Queue() {};
-	void Push(T _value) {
+	void Push(T _val) {
 		Node<T>* newNode = new Node<T>;
-		newNode->value = _value;
-		size++;
+		newNode->val = _val;
 		if (head == nullptr) {
-			head = newNode;
-			tail = newNode;
+			head = tail = newNode;
 		}
 		else {
 			tail->next = newNode;
 			tail = tail->next;
 		}
+		size += 1;
 	}
-	T Pop() {
-		if (size == 0) return -1;
-		else {
-			Node<T>* ptr = head;
-			T value = head->value;
 
-			if (head == tail) {
-				head = tail = nullptr;
-			}
-			else {
-				head = head->next;
-			}
-			delete ptr;
-			return value;
-		}
+	T Pop() {
+		if (!size) return -1;
+		Node<T>* ptr = head;
+		int value = ptr->val;
+		if (head == tail) head = tail = nullptr;
+		else head = head->next;
+		delete ptr;
+		size -= 1;
+		return value;
 	}
+
 	bool Empty() {
-		if (head == nullptr) return true;
+		if (!size) return true;
 		else return false;
 	}
-	T Front() {
-		return head->value;
+
+	T front() {
+		return head->val;
 	}
 };
 int main() {

STL_구현/stack.cpp

@@ -1,10 +1,10 @@
-#include<iostream>
+#include <iostream>
 using namespace std;
 template <typename T>
 class Node {
 public:
-	T value;
-	Node<T>* next = nullptr;
+	T val;
+	Node<T>* next;
 	Node() {};
 	~Node() {};
 };
@@ -17,45 +17,47 @@ class Stack {
 public:
 	Stack() : head(nullptr), tail(nullptr), size(0) {};
 	~Stack() {};
-	void Push(T _value) {
+	void Push(T _val) {
 		Node<T>* newNode = new Node<T>;
-		newNode->value = _value;
+		newNode->val = _val;
 		if (head == nullptr) {
 			head = tail = newNode;
 		}
 		else {
 			tail->next = newNode;
 			tail = tail->next;
 		}
-		size++;
+		size += 1;
 	}
 	T Pop() {
-		if (size == 0) return -1;
+		if (!size) return -1;
+		Node<T>* ptr = head;
+		T value = ptr->val;
+		if (head == tail) {
+			delete tail;
+			head = tail = nullptr;
+		}
 		else {
-			Node<T>* ptr = head;
-			int value = ptr->value;
-			if (head == tail) {
-				head = tail = nullptr;
-			}
-			else {
-				while (ptr != nullptr) {
-					if (ptr->next == tail) break;
-					ptr = ptr->next;
-				}
-				value = ptr->next->value;
+			while (ptr->next != tail) {
+				ptr = ptr->next;
 			}
+			value = ptr->next->val;
 			delete tail;
 			tail = ptr;
-			size--;
-			return value;
 		}
+		size--;
+		return value;
 	}
-	T Top() {
-		return tail->value;
+	bool Empty() {
+		if (!size) return true;
+		else return false;
 	}
 	T Size() {
 		return size;
 	}
+	T Top() {
+		return tail->val;
+	}
 };
 int main() {
 	Stack<int> s;
@@ -74,5 +76,4 @@ int main() {
 	cout << s.Pop() << "\n";
 	cout << "TOP: " << s.Top() << "\n";
 	cout << s.Pop() << "\n";
-
 }