206. 反转链表【cpp】

class Solution
{
    
    
public:
    ListNode *reverseList(ListNode *head)
    {
    
    
        ListNode *myHead = nullptr;
        while (head != nullptr)
        {
    
    
            ListNode *tmp = head->next;
            head->next = myHead;
            myHead = head;
            head = tmp;
        }
        return myHead;
    }
};