一种方法，它使用Java中的堆栈返回一个新的受人尊敬的单向链表，保持相同的元素，但以相反的顺序打印出来

import java.util.Stack;

public class ReversePrintLinkedList {
    public static class ListNode {
        int val;
        ListNode next;

        ListNode(int val) {
            this.val = val;
        }
    }

    public static void reversePrint(ListNode head) {
        Stack<ListNode> stack = new Stack<>();
        ListNode node = head;
        while (node != null) {
            stack.push(node);
            node = node.next;
        }
        while (!stack.isEmpty()) {
            ListNode currNode = stack.pop();
            System.out.print(currNode.val + " ");
        }
    }

    public static void main(String[] args) {
        // 创建链表
        ListNode head = new ListNode(1);
        ListNode node2 = new ListNode(2);
        ListNode node3 = new ListNode(3);
        ListNode node4 = new ListNode(4);
        head.next = node2;
        node2.next = node3;
        node3.next = node4;

        // 反向打印链表
        reversePrint(head);
    }
}