剑指offer-从尾到头打印链表

class Solution {
    public int[] reversePrint(ListNode head) {
        Stack<ListNode> stack = new Stack<ListNode>();//new 一个栈
        ListNode temp = head;//头节点指向
        while (temp != null) {//节点所指的不能为空
            stack.push(temp);//压栈
            temp = temp.next;//指针后移
        }
        int size = stack.size();//获取栈的长度
        int[] print = new int[size];//新建数组存储栈元素的值，print数组用于返回翻转后数组的值
        for (int i = 0; i < size; i++) {
            print[i] = stack.pop().val;//将栈中元素的值赋值给数组
        }
        return print;//打印数组
    }
}