如何为链表创建一个复制构造函数？

#include <iostream>

// 定义链表节点
class Node {
public:
    int data;
    Node* next;

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

// 定义链表
class LinkedList {
private:
    Node* head;

public:
    LinkedList() {
        head = nullptr;
    }

    // 复制构造函数
    LinkedList(const LinkedList& other) {
        if (other.head == nullptr) {
            head = nullptr;
            return;
        }

        // 复制头节点
        head = new Node(other.head->data);

        // 复制剩余节点
        Node* curr = head;
        Node* currOther = other.head->next;

        while (currOther != nullptr) {
            curr->next = new Node(currOther->data);
            curr = curr->next;
            currOther = currOther->next;
        }
    }

    // 打印链表
    void printList() {
        Node* curr = head;
        while (curr != nullptr) {
            std::cout << curr->data << " ";
            curr = curr->next;
        }
        std::cout << std::endl;
    }

    // 添加节点到链表末尾
    void addNode(int value) {
        Node* newNode = new Node(value);

        if (head == nullptr) {
            head = newNode;
            return;
        }

        Node* curr = head;
        while (curr->next != nullptr) {
            curr = curr->next;
        }
        curr->next = newNode;
    }
};

int main() {
    LinkedList list1;
    list1.addNode(1);
    list1.addNode(2);
    list1.addNode(3);

    LinkedList list2 = list1;  // 使用复制构造函数创建新的链表对象

    list1.addNode(4);
    list1.printList();  // 输出: 1 2 3 4
    list2.printList();  // 输出: 1 2 3

    return 0;
}