题解 | #从尾到头打印链表#

int* printListFromTailToHead(struct ListNode* listNode, int* returnSize ) {
    // write code here
        struct ListNode* p=listNode;
        int count=0;
        while(p!=NULL){
            count++;
            p=p->next;
        }
        int a[count];
        int i=0;
        p=listNode;
        while(p!=NULL){
            a[i]=p->val;
            i++;
            p=p->next;
        }
        * returnSize=count;
        int *b=(int *)malloc(sizeof(int)*count);
        for(int k=0;k<count;k++){
            b[k]=a[i-1];
            i--;
        }
        return b;
}