反转链表与链表的析构操作(C++)

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* cur=head, *pre=nullptr;
        while (cur) {
            auto tmp=cur->next;
            cur->next=pre;
            pre=cur;
            cur=tmp;
        }
        return pre;
    }
};

LinkedList::~LinkedList() {
    ListNode* cur;
    while (head->next) {
        cur = head->next;
        delete head;
        head = cur;
    }
    delete head;
}