int* reversePrint(struct ListNode* head, int* returnSize){
    int stack[10000];
    int top = 0;
    struct ListNode *p = head;
    while(p != NULL)
    {
        stack[top++] = p->val;
        p = p->next;
    }
    *returnSize = top;
    int *res = malloc(sizeof(int)*(*returnSize));
    for(int i = top-1,j=0;i>=0;i--,j++)
    {
        res[j] = stack[i];
    }
    return res;
}