【剑指offer】从尾到头打印链表

public class  {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}

ArrayList<Integer> list = new ArrayList<>();

public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
    if (listNode != null){
        printListFromTailToHead(listNode.next);
        list.add(listNode.val);
    }

    return list;
}