test.py

Huy
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode *curr = head;
        ListNode *next = head;
        ListNode *temp = head;
        ListNode *prev = NULL;
        int numOfNode = 0;

        while(temp->next != NULL) {
            temp = temp->next;
            numOfNode++;
        }

        if (numOfNode != 0) {
            while (curr != NULL) {
                next = curr->next;
                curr->next = prev;
                prev = curr;
                curr = next;
            }
        } else {
            return;
        }
        return;
    }
};