/**
*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.Stack;
import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> list=new ArrayList<Integer>();
        if(listNode==null){
            return list;
        }
        
        接下来用栈进行判断
        
        Stack<Integer> stack=new Stack<Integer>();
        while(listNode!=null){
            stack.add(listNode.val);
            listNode=listNode.next;
        }
        
        while(!stack.isEmpty()){
            list.add(stack.pop());
        }
        
        return list;
    }
}