c++怎么实现一个链表_c++链表实现方法

struct Node {

    int data;

立即学习“C++免费学习笔记（深入）”；

    Node* next;

    Node(int val) : data(val), next(nullptr) {}

};

class LinkedList {

private:

    Node* head;

public:

    LinkedList() : head(nullptr) {}

    ~LinkedList();

    void insertAtHead(int val);

    void insertAtTail(int val);

    void deleteValue(int val);

    bool search(int val);

    void display();

};

void LinkedList::insertAtHead(int val) {

    Node* newNode = new Node(val);

    newNode->next = head;

    head = newNode;

}

void LinkedList::insertAtTail(int val) {

    Node* newNode = new Node(val);

    if (!head) {

        head = newNode;

        return;

    }

爱图表

AI驱动的智能化图表创作平台

99

查看详情

    Node* current = head;

    while (current->next) {

        current = current->next;

    }

    current->next = newNode;

}

void LinkedList::display() {

    Node* current = head;

    while (current) {

        std::cout << current->data << " -> ";

        current = current->next;

    }

    std::cout << "nullptr" << std::endl;

}

LinkedList::~LinkedList() {

    Node* current = head;

    while (current) {

        Node* next = current->next;

        delete current;

        current = next;

    }

}

int main() {

    LinkedList list;

    list.insertAtHead(10);

    list.insertAtTail(20);

    list.insertAtTail(30);

    list.display(); // 输出: 10 -> 20 -> 30 -> nullptr

    std::cout << (list.search(20) ? "Found" : "Not found") << std::endl;

    return 0;

}