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

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 void recursion(ListNode node, ArrayList<Integer> list){
        if(node != null){
            recursion(node.next, list);
            list.add(node.val);
        }
    }

    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer> list = new ArrayList<>();
        recursion(listNode, list);
        return list;
        
    }
}