24.反转链表*

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode *slow = nullptr, *fast = head;
        while(fast != nullptr) {
            ListNode *p = fast->next;
            fast->next = slow;
            slow = fast;
            fast = p;
        }
        return slow;
    }
};