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

import java.util.ArrayList;
import java.util.Stack;

class ListNode {
int val;
ListNode next = null;

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

public class Solution {
public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
Stack<Integer> stack = new Stack<Integer>();
ArrayList<Integer> list = new ArrayList<Integer>();
while(listNode != null){
stack.add(listNode.val);
listNode = listNode.next;
}

while(!stack.isEmpty()){
list.add(stack.pop());
}

return list;
}
}