从尾到头打印链表

/** 
*    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<ListNode> stack = new Stack(); 
        while(null != listNode){ 
            stack.push(listNode); 
            listNode = listNode.next; 
        } 
        ArrayList<Integer> array = new ArrayList(stack.size()); 
        while(!stack.isEmpty()){ 
            array.add(Integer.valueOf(stack.pop().val)); 
        } 
        return array; 
    } 
}