链表反转写法

class Solution {

public:

ListNode* reverseList(ListNode* head) {

ListNode *prev = nullptr, *curr = head;

while (curr) {

ListNode *next = curr->next;

curr->next = prev;

prev = curr;

curr = next;

}

return prev;

}

};