Добавил решение четвёртой задачи по связным спискам

1 files changed, 100 insertions, 0 deletions

diff --git a/list/list.h b/list/list.h
new file mode 100644
index 0000000..fe2c967
--- /dev/null
+++ b/list/list.h
@@ -0,0 +1,100 @@
+#include <iostream>
+
+struct list
+{
+    int inf;
+    list *next;
+    list *prev;
+};
+
+
+void push(list *&h, list *&t, int x)
+{
+    list *r = new list;
+    r->inf = x;
+    r->next = NULL;
+    if (!h && !t)
+    {
+        r->prev = NULL;
+        h = r;
+    }
+    else
+    {
+        t->next = r;
+        r->prev = t;
+    }
+    t = r;
+}
+
+void print(list *h, list *t)
+{
+    list *p = h;
+    while (p)
+    {
+        std::cout << p->inf << " ";
+        p = p->next;
+    }
+}
+
+list *find(list *h, list *t, int x)
+{
+    list *p = h;
+    while (p)
+    {
+        if (p->inf == x) break;
+        p = p->next;
+    }
+    return p;
+}
+
+void insert_after(list *&h, list *&t, list *r, int y)
+{
+    list *p = new list;
+    p->inf = y;
+    if (r == t)
+    {
+        p->next = NULL;
+        p->prev = r;
+        r->next = p;
+        t = p;
+    }
+    else {
+        r->next->prev = p;
+        p->next = r->next;
+        p->prev = r;
+        r->next = p;
+    }
+}
+
+void del_node(list *&h, list *&t, list *r)
+{
+    if (r == h && r == t)
+        h = t = NULL;
+    else if (r == h)
+    {
+        h = h->next;
+        h->prev = NULL;
+    }
+    else if (r == t)
+    {
+        t = t->prev;
+        t->next = NULL;
+    }
+    else
+    {
+        r->next->prev = r->prev;
+        r->prev->next = r->next;
+    }
+    delete r;
+}
+
+void del_list(list *&h, list *&t)
+{
+    while (h)
+    {
+        list *p = h;
+        h = h->next;
+        h->prev = NULL;
+        delete p;
+    }
+}