From 7ceaaaf631a5e7315c179d36173f1d3c057c92cf Mon Sep 17 00:00:00 2001 From: Antonio Date: Sun, 30 Sep 2018 22:49:23 +0300 Subject: [PATCH 1/4] Initial commit --- CPP/data-structures/ResizableArray.h | 130 +++++++++++++++++++++++++++ 1 file changed, 130 insertions(+) create mode 100644 CPP/data-structures/ResizableArray.h diff --git a/CPP/data-structures/ResizableArray.h b/CPP/data-structures/ResizableArray.h new file mode 100644 index 0000000..18a0e90 --- /dev/null +++ b/CPP/data-structures/ResizableArray.h @@ -0,0 +1,130 @@ +/* + ResizableArray.h + Copyright Antonio Macovei +*/ + +#ifndef RESIZABLEARRAY_H_ +#define RESIZABLEARRAY_H_ + +template +class ResizableArray { + private: + int defaultCapacity = 1; + + int numElements; + int maxCapacity; + T *data; + + void resizeArray() { + maxCapacity = maxCapacity + 1; + T *temp; + temp = new T[maxCapacity]; + for (int i = 0; i < numElements; i++) { + temp[i] = data[i]; + } + delete[] data; + data = temp; + } + + // Shift elements one position to the right + void shift_elements_right(int start) { + for (int i = numElements; i > start; i--) { + data[i] = data[i - 1]; + } + } + + // Shift elements one position to the left + void shift_elements_left(int stop) { + for (int i = satop; i < numElements; i++) { + data[i] = data[i + 1]; + } + } + + public: + // Constructor + ResizableArray() { + numElements = 0; + maxCapacity = defaultCapacity; + + data = new T[maxCapacity]; + } + + // Destructor + ~ResizableArray() { + delete[] data; + } + + /** + * Adds the specified element at the end of the array. + * + * @param element Element to be added at the end of the array. + */ + void add_last(T element) { + if (numElements == maxCapacity) { + resizeArray(); + } + data[numElements] = element; + numElements++; + } + + /** + * Adds the specified element at the beginning of the array. + * + * @param element Elment to be added at the beginning of the array. + */ + void add_first(T element) { + if (numElements == maxCapacity) { + resizeArray(); + } + numElements++; + shift_elements_right(0); + data[0] = element; + } + + /** + * Removes and returns the last element of the array. + * + * @return Value of the last element stored in the array. + */ + void remove_last() { + if (numElements == 0) return; + numElements--; + } + + /** + * Removes and returns the first element of the array. + * + * @return Value of the first element stored in the array. + */ + void remove_first() { + if (numElements == 0) return; + shift_elements_left(0); + numElements--; + } + + /** + * Checks if the array contains any elements. + * + * @return True if the array contains no elements, False otherwise. + */ + bool is_empty() { + if (numElements == 0) + return true; + return false; + } + + /** + * Returns the number of elements in the array. + * + * @return The number of elements stored in the array. + */ + int size() { + return numElements; + } + + // Getters + T *get_data() { + return data; + } +}; +#endif // RESIZABLEARRAY_H_ \ No newline at end of file From 6dc315667502750c6fc2c4183ed37c30558f100f Mon Sep 17 00:00:00 2001 From: Antonio Date: Sun, 30 Sep 2018 22:54:22 +0300 Subject: [PATCH 2/4] Added me in CONTRIBUTORS.md --- CONTRIBUTORS.md | 1 + 1 file changed, 1 insertion(+) diff --git a/CONTRIBUTORS.md b/CONTRIBUTORS.md index c6d76e6..b035b7b 100644 --- a/CONTRIBUTORS.md +++ b/CONTRIBUTORS.md @@ -1,3 +1,4 @@ # Add yourself in this file if you are a contributor for Hacktoberfest 2018 - Radu Stochitoiu +- Antonio Macovei \ No newline at end of file From 21463c5e6b1db30f70811130f339ab9d8b166153 Mon Sep 17 00:00:00 2001 From: Antonio Date: Sun, 30 Sep 2018 23:01:40 +0300 Subject: [PATCH 3/4] Added DoublyLinkedList.h --- CPP/data-structures/DoublyLinkedList.h | 169 +++++++++++++++++++++++++ 1 file changed, 169 insertions(+) create mode 100644 CPP/data-structures/DoublyLinkedList.h diff --git a/CPP/data-structures/DoublyLinkedList.h b/CPP/data-structures/DoublyLinkedList.h new file mode 100644 index 0000000..94cef57 --- /dev/null +++ b/CPP/data-structures/DoublyLinkedList.h @@ -0,0 +1,169 @@ +/* + DoublyLinkedList.h + Copyright Antonio Macovei +*/ + +#ifndef DOUBLYLINKEDLIST_H_ +#define DOUBLYLINKEDLIST_H_ + +template +struct Node { + T data; + Node *next; + Node *prev; + + explicit Node(T data) { + this->data = data; + this->next = nullptr; + this->prev = nullptr; + } +}; + +template +class DoublyLinkedList { + private: + Node *head; + Node *tail; + int numElements; + + // Returns the pos'th node in the list. + Node *goToPos(int pos) { + int count = 0; + Node *it = head; + + while (count != pos) { + it = it->next; + count++; + } + return it; + } + + public: + // Constructor + DoublyLinkedList() { + head = nullptr; + tail = nullptr; + numElements = 0; + } + + // Destructor + ~DoublyLinkedList() { + while (head != nullptr) { + Node *temp = head; + head = head->next; + delete temp; + } + } + + /** + * Adds a new node at the beginning of the list. + * + * @param data Data to be added at the end of the list. + */ + void add_first(T data) { + if (head == nullptr) { + head = new Node(data); + head->next = nullptr; + head->prev = nullptr; + tail = head; + } else { + Node *new_node; + new_node = new Node(data); + new_node->next = head; + new_node->prev = nullptr; + head->prev = new_node; + head = new_node; + } + numElements++; + } + + /** + * Adds a new node at the end of the list. + * + * @param data Data to be added at the end of the list. + */ + void add_last(T data) { + if (head == nullptr) { + head = new Node(data); + head->next = nullptr; + head->prev = nullptr; + tail = head; + } else { + Node *new_node; + new_node = new Node(data); + new_node->next = nullptr; + new_node->prev = tail; + tail->next = new_node; + tail = new_node; + } + numElements++; + } + + /** + * Removes the last node of the list. + */ + void remove_last() { + if (numElements == 0) return; + if (numElements == 1) { + delete tail; + tail = nullptr; + head = nullptr; + numElements = 0; + } else { + Node *new_tail = tail->prev; + tail->prev->next = nullptr; + delete tail; + tail = new_tail; + numElements--; + } + } + + /** + * Removes the first node of the list. + */ + void remove_first() { + if (numElements == 0) return; + if (numElements == 1) { + delete head; + tail = nullptr; + head = nullptr; + numElements = 0; + } else { + Node *new_head = head->next; + head->next->prev = nullptr; + delete head; + head = new_head; + numElements--; + } + } + + /** + * Check if the list contains any elements. + * + * @return True if the list contains no elements, False otherwise. + */ + bool is_empty() { + if (numElements == 0) + return true; + return false; + } + + /** + * Get the number of nodes in the list. + * + * @return The number of nodes stored in the list. + */ + int size() { + return numElements; + } + + // Getters & Setters + Node *get_head() { + return head; + } + + Node *get_tail() { + return tail; + } +}; +#endif // DOUBLYLINKEDLIST_H_ \ No newline at end of file From 87bf95b15e193210820efcb8f0b1a341a0850c1f Mon Sep 17 00:00:00 2001 From: Antonio Date: Mon, 1 Oct 2018 12:28:33 +0300 Subject: [PATCH 4/4] Fixed indentation and comments --- CPP/data-structures/DoublyLinkedList.h | 238 +++++++++++-------------- 1 file changed, 105 insertions(+), 133 deletions(-) diff --git a/CPP/data-structures/DoublyLinkedList.h b/CPP/data-structures/DoublyLinkedList.h index 94cef57..66eba24 100644 --- a/CPP/data-structures/DoublyLinkedList.h +++ b/CPP/data-structures/DoublyLinkedList.h @@ -1,8 +1,3 @@ -/* - DoublyLinkedList.h - Copyright Antonio Macovei -*/ - #ifndef DOUBLYLINKEDLIST_H_ #define DOUBLYLINKEDLIST_H_ @@ -21,149 +16,126 @@ struct Node { template class DoublyLinkedList { - private: - Node *head; - Node *tail; - int numElements; - - // Returns the pos'th node in the list. - Node *goToPos(int pos) { - int count = 0; - Node *it = head; - - while (count != pos) { - it = it->next; - count++; - } - return it; +private: + Node *head; + Node *tail; + int numElements; + + // Returns the pos'th node in the list + Node *goToPos(int pos) { + int count = 0; + Node *it = head; + + while (count != pos) { + it = it->next; + count++; } + return it; + } - public: - // Constructor - DoublyLinkedList() { - head = nullptr; - tail = nullptr; - numElements = 0; - } +public: + DoublyLinkedList() { + head = nullptr; + tail = nullptr; + numElements = 0; + } - // Destructor - ~DoublyLinkedList() { - while (head != nullptr) { - Node *temp = head; - head = head->next; - delete temp; - } + ~DoublyLinkedList() { + while (head != nullptr) { + Node *temp = head; + head = head->next; + delete temp; } + } - /** - * Adds a new node at the beginning of the list. - * - * @param data Data to be added at the end of the list. - */ - void add_first(T data) { - if (head == nullptr) { - head = new Node(data); - head->next = nullptr; - head->prev = nullptr; - tail = head; - } else { - Node *new_node; - new_node = new Node(data); - new_node->next = head; - new_node->prev = nullptr; - head->prev = new_node; - head = new_node; - } - numElements++; + // Adds a new node at the beginning of the list + void add_first(T data) { + if (head == nullptr) { + head = new Node(data); + head->next = nullptr; + head->prev = nullptr; + tail = head; + } else { + Node *new_node; + new_node = new Node(data); + new_node->next = head; + new_node->prev = nullptr; + head->prev = new_node; + head = new_node; } + numElements++; + } - /** - * Adds a new node at the end of the list. - * - * @param data Data to be added at the end of the list. - */ - void add_last(T data) { - if (head == nullptr) { - head = new Node(data); - head->next = nullptr; - head->prev = nullptr; - tail = head; - } else { - Node *new_node; - new_node = new Node(data); - new_node->next = nullptr; - new_node->prev = tail; - tail->next = new_node; - tail = new_node; - } - numElements++; + // Adds a new node at the end of the list + void add_last(T data) { + if (head == nullptr) { + head = new Node(data); + head->next = nullptr; + head->prev = nullptr; + tail = head; + } else { + Node *new_node; + new_node = new Node(data); + new_node->next = nullptr; + new_node->prev = tail; + tail->next = new_node; + tail = new_node; } + numElements++; + } - /** - * Removes the last node of the list. - */ - void remove_last() { - if (numElements == 0) return; - if (numElements == 1) { - delete tail; - tail = nullptr; - head = nullptr; - numElements = 0; - } else { - Node *new_tail = tail->prev; - tail->prev->next = nullptr; - delete tail; - tail = new_tail; - numElements--; - } + // Removes the last node of the list + void remove_last() { + if (numElements == 0) return; + if (numElements == 1) { + delete tail; + tail = nullptr; + head = nullptr; + numElements = 0; + } else { + Node *new_tail = tail->prev; + tail->prev->next = nullptr; + delete tail; + tail = new_tail; + numElements--; } + } - /** - * Removes the first node of the list. - */ - void remove_first() { - if (numElements == 0) return; - if (numElements == 1) { - delete head; - tail = nullptr; - head = nullptr; - numElements = 0; - } else { - Node *new_head = head->next; - head->next->prev = nullptr; - delete head; - head = new_head; - numElements--; - } + // Removes the first node of the list + void remove_first() { + if (numElements == 0) return; + if (numElements == 1) { + delete head; + tail = nullptr; + head = nullptr; + numElements = 0; + } else { + Node *new_head = head->next; + head->next->prev = nullptr; + delete head; + head = new_head; + numElements--; } + } - /** - * Check if the list contains any elements. - * - * @return True if the list contains no elements, False otherwise. - */ - bool is_empty() { - if (numElements == 0) - return true; - return false; - } + // Check if the list contains any elements + bool is_empty() { + if (numElements == 0) + return true; + return false; + } - /** - * Get the number of nodes in the list. - * - * @return The number of nodes stored in the list. - */ - int size() { - return numElements; - } + // Get the number of nodes in the list + int size() { + return numElements; + } - // Getters & Setters - Node *get_head() { - return head; - } + Node *get_head() { + return head; + } - Node *get_tail() { - return tail; - } + Node *get_tail() { + return tail; + } }; #endif // DOUBLYLINKEDLIST_H_ \ No newline at end of file