从列表末尾删除C++时，LinkedList Remove函数失败

#include <iostream>

struct Node {
    int data;
    Node* next;
};

class LinkedList {
private:
    Node* head;

public:
    LinkedList() {
        head = nullptr;
    }

    void Add(int value) {
        Node* newNode = new Node;
        newNode->data = value;
        newNode->next = nullptr;

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

    void Remove() {
        if (head == nullptr) {
            std::cout << "LinkedList is empty." << std::endl;
            return;
        }

        if (head->next == nullptr) {
            delete head;
            head = nullptr;
            return;
        }

        Node* current = head;
        while (current->next->next != nullptr) {
            current = current->next;
        }
        delete current->next;
        current->next = nullptr;
    }

    void Print() {
        Node* current = head;
        while (current != nullptr) {
            std::cout << current->data << " ";
            current = current->next;
        }
        std::cout << std::endl;
    }
};

int main() {
    LinkedList list;
    list.Add(1);
    list.Add(2);
    list.Add(3);
    list.Print();  // Output: 1 2 3

    list.Remove();
    list.Print();  // Output: 1 2

    list.Remove();
    list.Print();  // Output: 1

    list.Remove();
    list.Print();  // Output: LinkedList is empty.

    return 0;
}