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

public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
	ArrayList<Integer> res = new ArrayList<>();
		Stack<Integer> temp = new Stack<>();
		while(listNode!=null){
			temp.add(listNode.val);
			listNode = listNode.next;
		}
		
		while(!temp.isEmpty()){
			res.add(temp.pop());
		}
		return res;
    }
}