从尾到头打印链表

public class ReverseLink {
public class ListNode {
int val;
ListNode next = null;

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

public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
ArrayList<Integer> list = new ArrayList<>();
Stack<Integer> stack = new Stack<>();
while (listNode != null) {
stack.push(listNode.val);
listNode = listNode.next;
}
while (!stack.isEmpty()) {
list.add(stack.pop());
}
return list;
}
｝