C++实现一个封装的双链表的完整代码

#include<iostream>
using namespace std;

// 节点类型声明
struct Node
{
    int date;
    Node* last;  // 前驱节点
    Node* next;  // 后继节点
};

class DList
{
private:
    // 成员变量
    Node* phead;

public:
    // 构造函数
    DList() : phead(nullptr) {}

    // 析构函数
    ~DList()
    {
        while (phead != NULL)
        {
            PopFront();
        }
    }

    // 创建节点
    Node* CreateNode(int x)
    {
        Node* node = new Node;
        node->date = x;
        node->last = NULL;
        node->next = NULL;
        return node;
    }

    // 打印链表
    void PrintList()
    {
        Node* cur = phead;
        while (cur)
        {
            cout << cur->date << "<-->";  // 双向箭头表示双链表
            cur = cur->next;
        }
        cout << "NULL" << endl;
    }

    // 头插法
    void PushFront(int x)
    {
        Node* newnode = CreateNode(x);
        if (phead == NULL)
        {
            phead = newnode;
        }
        else
        {
            newnode->next = phead;
            phead->last = newnode;
            phead = newnode;
        }
    }

    // 尾插法
    void PushBack(int x)
    {
        Node* newnode = CreateNode(x);
        if (phead == NULL)
        {
            phead = newnode;
        }
        else
        {
            Node* tail = phead;
            while (tail->next != NULL)
            {
                tail = tail->next;
            }
            tail->next = newnode;
            newnode->last = tail;
        }
    }

    // 头删法
    void PopFront()
    {
        if (phead == NULL)
        {
            cout << "链表为空，无法进行删除操作！" << endl;
        }
        else
        {
            Node* del = phead;
            phead = del->next;
            if (phead != NULL)
            {
                phead->last = NULL;
            }
            delete del;
            del = NULL;
        }
    }

    // 尾删法
    void PopBack()
    {
        if (phead == NULL)
        {
            cout << "链表为空，无法进行删除操作！" << endl;
        }
        else
        {
            if (phead->next == NULL)  // 只有一个节点
            {
                delete phead;
                phead = NULL;
            }
            else
            {
                Node* tail = phead;
                while (tail->next != NULL)
                {
                    tail = tail->next;
                }
                tail->last->next = NULL;
                delete tail;
                tail = NULL;
            }
        }
    }
     //指定元素后插入
    void InsertAfter(int v, int x)
    {
        Node* node = phead;
        while (node != NULL && node->date != v)
        {
            node = node->next;
        }

        if (node == NULL)
        {
            cout << "未找到值为 " << v << " 的节点，无法插入!" << endl;
            return;
        }

        Node* newnode = CreateNode(x);
        newnode->last = node;
        newnode->next = node->next;

        if (node->next != NULL)
        {
            node->next->last = newnode;
        }

        node->next = newnode;
    }

    // 根据值删除节点
    void PopValue(int value)
    {
        if (phead == NULL)
        {
            cout << "链表为空，无法进行删除操作！" << endl;
            return;
        }
        Node* cur = phead;
        while (cur != NULL)
        {
            if (cur->date == value)
            {
                // 删除节点
                if (cur->last != NULL)
                {
                    cur->last->next = cur->next;
                }
                else
                {
                    // 删除的是头节点
                    phead = cur->next;
                }

                if (cur->next != NULL)
                {
                    cur->next->last = cur->last;
                }
                delete cur;
                cur = NULL;
                cout << "删除节点 " << value << " 成功！" << endl;
                return;
            }
            cur = cur->next;
        }
        cout << "未找到值为 " << value << " 的节点！" << endl;
    }
};

int main()
{
    DList ls1;
    ls1.PushBack(1);
    ls1.PushBack(2);
    ls1.PushBack(3);
    ls1.PushBack(4);
    ls1.PushBack(5);
    ls1.PrintList();

    ls1.PopFront();
    ls1.PopBack();
    ls1.PushFront(9);
    ls1.PrintList();

    ls1.InsertAfter(9,7);
    ls1.PrintList();

    ls1.PopValue(4);
    ls1.PrintList();
    return 0;
}