剑指 offer 面试题精选图解 06 . 从尾到头打印链表

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

class Solution {
    public int[] reversePrint(ListNode head) {
        Deque<Integer> stack = new ArrayDeque<>();
        ListNode curNode = head;
        while (curNode != null) {
            stack.addLast(curNode.val);
            curNode = curNode.next;
        }

        int size = stack.size();
        int[] res = new int[size];

        for (int i = 0; i < size; i++) {
           res[i] = stack.removeLast();
        }
        return res;
    }
}