C++双向链表删除操作详解

struct Node {
    int data;
    Node* prev;
    Node* next;
    Node(int val) : data(val), prev(nullptr), next(nullptr) {}
};

void deleteNode(Node*& head, Node* del) {
    if (!head || !del) return;
// 如果删除的是头节点
if (head == del) {
    head = del->next;
}

// 断开前驱连接
if (del->prev) {
    del->prev->next = del->next;
}

// 断开后继连接
if (del->next) {
    del->next->prev = del->prev;
}

// 释放内存
delete del;
}

void deleteByValue(Node*& head, int value) {
    Node* current = head;
    while (current) {
        if (current->data == value) {
            Node* toDelete = current;
            current = current->next;  // 先保存下一个节点
            deleteNode(head, toDelete);
        } else {
            current = current->next;
        }
    }
}