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

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) {
        int count = 0;
        ArrayList a = new ArrayList();
        ArrayList b = new ArrayList();
        while(listNode != null) {
            count++;
            a.add(listNode.val);
            listNode = listNode.next;
        }

        for (int i = 0; i < count; i++) {
            b.add(a.get(count - 1 - i));
        }
        return b;
    }
}