leetcode 206. Reverse Linked List

Reverse a singly linked list.

Example:

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL

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