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

/**
*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        
        Stack<Integer> stack = new Stack<Integer>();
        ArrayList<Integer> arrayList = new ArrayList<Integer>();
        
        while(listNode!=null){
            stack.push(listNode.val);
            listNode = listNode.next;
        }
        while(!stack.empty()){
            arrayList.add(stack.pop());
        }
        return arrayList;
    }
}