剑指 Offer 06. 从尾到头打印链表

输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

示例 1：

输入：head = [1,3,2]
输出：[2,3,1]

限制：

0 <= 链表长度 <= 10000

题解1：

        
        
        
        public int[] reversePrint(ListNode head) {
            
            Stack stack = new Stack<>();
            while (head != null) {
                stack.push(head.val);
                head = head.next;
            }
            int stackSize = stack.size();
            int[] array = new int[stackSize];
            for (int i = 0; i < stackSize; i++) {
                array[i] = stack.pop();
            }
            return array;
        }
    }