题解 | #从尾到头打印链表#

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

        
    }
}