從尾到頭筛谚，首先想到的是遞歸碑宴。
int* reversePrint(struct ListNode* head, int* returnSize)
{
if(head == NULL){
*returnSize = 0;
return malloc(sizeof(int) * 10000);
}
int *ans = reversePrint(head->next, returnSize);
ans[(*returnSize)++] = head->val;
return ans;
}
