List solve

module-1/homework/List/list.cpp

@@ -1,3 +1,165 @@
 #include "list.h"
-
-// Your code goes here...
+#include <iostream>
+List() {
+		first = nullptr;
+	}
+	int& front() {
+		return first->data;
+	}
+	int& back() {
+		Element* e = first;
+		while (e->next != nullptr)
+			e = e->next;
+		return e->data;
+	}
+	bool empty() {
+		return(first == nullptr);
+	}
+	int size() {
+		int i = 1;
+		Element* e = first;
+		if (e == nullptr)return 0;
+		while (e->next != nullptr)
+		{
+			e = e->next;
+			i++;
+		}
+		return i;
+	}
+	void push_back(int data_) {
+		Element* e = first;
+		while (e->next != nullptr)
+			e = e->next;
+		Element* newone;
+		e->next = newone;
+		newone->prev = e;
+		newone->data = data_;
+	}
+	void pop_back() {
+		Element* e = first;
+		if (e == nullptr)return;
+		while (e->next != nullptr)
+			e = e->next;
+		e->prev->next = nullptr;
+		delete e;
+	}
+	void push_front(int data) {
+		if (first == nullptr) {
+			first = new Element();
+			first->prev = nullptr;
+			first->next = nullptr;
+			first->data = data;
+		}
+		else {
+			Element* e = new Element();
+			e->data = data;
+			e->prev = nullptr;
+			e->next = first;
+			first->prev = e;
+			first = e;
+		}
+	}
+	void pop_front() {
+		if (first == nullptr)return;
+		first->next->prev = nullptr;
+		delete first;
+	}
+	void resize(int new_size) {
+		int temp_size = 0;
+		Element* e = first;
+		Element*e1=nullptr;
+		Element* temp;
+		if (new_size == 0)first = nullptr;
+		if (e == nullptr)return;
+		while (e!= nullptr)
+		{
+			if (temp_size == new_size)
+			{
+				if(e->prev!=nullptr)e->prev->next = nullptr;	
+				temp = e;
+				e = e->next;
+				delete temp;
+				temp_size++;
+				continue;
+			}
+			if (e->next == nullptr)e1 = e;
+			e = e->next;
+			temp_size++;
+		}
+		for (size_t j = temp_size; j < new_size; j++) {
+			temp = new Element();
+			temp->prev = e1;
+			temp->next = nullptr;
+			if(e1!=nullptr)
+				e1->next = temp;
+			e1 = temp;
+		}
+	}
+	void clear() {
+		while (first) {
+			Element* temp = first->next;
+			delete first;
+			first = temp;
+		}
+	}
+	void swap(List &b) {
+		List temp;
+		temp.first = first;
+		first = b.first;
+		b.first = temp.first;
+	}
+	void remove(int data_) {
+		Element* e = first;
+		Element* temp;
+		while (e != nullptr) {
+			if (e->data == data_) {
+				if (e->prev != nullptr) {
+					e->prev->next = e->next;
+				}
+				if (e->next != nullptr) {
+					e->next->prev = e->prev;
+				}	
+				temp = e;
+				e = e->next;
+				if (temp == first)
+				{
+					first = first->next;
+				}
+				delete temp;
+			}
+			else e = e->next;
+		}
+	}
+	void sort() {
+		Element* e = first;
+		Element* temp;
+		Element* temp1;
+		int n=size();
+		for (size_t i = 0; i < n; i++) {
+			for (size_t j = 0; j < n-1; j++) {
+				if (e->data > e->next->data)            
+				{
+					std::swap(e->data, e->next->data); 
+				}
+				e = e->next;
+			}
+			e = first;
+		}
+	}
+	void unique() {
+		Element* e = first->next;
+		Element* temp = first->next;
+		while (e != nullptr) {
+			if (e->prev->data == e->data) {
+				e->prev->next = e->next;
+				if (e->next != nullptr)
+				{
+					e->next->prev = e->prev;
+				}
+				temp = e;
+				e = e->next;
+				delete temp;
+			}
+			else e = e->next;
+		}
+	}

module-1/homework/List/list.h

@@ -8,7 +8,6 @@ namespace task {
 class list {
 
 public:
-
     list();
     list(size_t count, const int& value = int());
 
@@ -39,11 +38,19 @@ class list {
     void remove(const int& value);
     void unique();
     void sort();
-
+    
     // Your code goes here?..
+        void swap(Element* a, Element* b);
+    void swap(int& a, int& b);
 
 private:
-
+struct Element {
+		int data;
+		Element* prev;
+		Element* next;
+
+	};
+		Element* first;
     // Your code goes here...
 
 };