/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 * 
 * Note: The returned array must be malloced, assume caller calls free().
 */

int arr[100000];
int* printListReversingly(struct ListNode* head) {
    struct ListNode * pre = NULL;
    struct ListNode * cur = head;
    while(cur)
    {
        struct ListNode * next = cur->next;
        cur->next = pre;
        pre = cur;
        cur = next;
    }
    int i = 0;
    while(pre)
    {
        //printf("%d ", pre->val);
        arr[i++] = pre->val;
        pre = pre->next;
    }
    return arr;
}