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

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


        return ans;
    }
}