一、题目链接

题目描述：使用栈，实现单链表的逆序打印

二、解题思路

三、解题代码

  /**
     * 非递归实现单链表的顶逆序打印——>通过栈来实现
     * @param
     */
    public void printReverseListFromStack(){
        Stack<Node> stack = new Stack<>();
        Node cur = head;
        while(cur != null){
            stack.push(cur);
            cur = cur.next;
        }
        while(!stack.empty()){
            Node toPrint = stack.pop();
            System.out.print(toPrint.val+" ");
        }
        System.out.println();
    }