java刷题--剑指offer06 从头到尾打印链表

题目

代码

class Solution {
    public int[] reversePrint(ListNode head) {
        Stack<ListNode> stack = new Stack();
        ListNode pre = head;
        while(pre!=null) {
            stack.push(pre);
            pre = pre.next;
        }
        int[] res = new int[stack.size()];
        int i=0;
        while(!stack.isEmpty()) {
            res[i++] = stack.pop().val;
        }return res;
    }
}

结果