带有返回类型节点*的函数，与c++中的OOP结合使用

#include <iostream>

// 定义一个节点类
class Node {
public:
    int data;
    Node* next;

    Node(int value) {
        data = value;
        next = nullptr;
    }
};

// 返回类型节点*的函数，用于创建新节点
Node* createNode(int value) {
    Node* newNode = new Node(value);
    return newNode;
}

// 返回类型节点*的函数，用于在链表末尾添加新节点
Node* appendNode(Node* head, int value) {
    Node* newNode = createNode(value);
    if (head == nullptr) {
        head = newNode;
    } else {
        Node* current = head;
        while (current->next != nullptr) {
            current = current->next;
        }
        current->next = newNode;
    }
    return head;
}

// 返回类型节点*的函数，用于删除指定值的节点
Node* deleteNode(Node* head, int value) {
    Node* current = head;
    Node* prev = nullptr;
    while (current != nullptr) {
        if (current->data == value) {
            if (prev == nullptr) {
                head = current->next;
            } else {
                prev->next = current->next;
            }
            delete current;
            break;
        }
        prev = current;
        current = current->next;
    }
    return head;
}

// 返回类型节点*的函数，用于打印链表中的节点值
void printList(Node* head) {
    Node* current = head;
    while (current != nullptr) {
        std::cout << current->data << " ";
        current = current->next;
    }
    std::cout << std::endl;
}

int main() {
    Node* head = nullptr;

    // 在链表末尾添加节点
    head = appendNode(head, 1);
    head = appendNode(head, 2);
    head = appendNode(head, 3);

    // 打印链表
    std::cout << "Linked List: ";
    printList(head);

    // 删除节点
    head = deleteNode(head, 2);

    // 打印链表
    std::cout << "Linked List after deletion: ";
    printList(head);

    return 0;
}