【EveryDay算法题】First Day

从尾到头打印链表

输入一个链表，按链表值从尾到头的顺序返回一个ArrayList

/**
*    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) {
         ArrayList<Integer> list = new ArrayList<>();
        return recurrenceList(list,listNode);
       
    }
     public ArrayList<Integer> recurrenceList(ArrayList<Integer> list,ListNode listNode){
         if(listNode == null){
             return list;
         }
         if(listNode != null){
             recurrenceList(list,listNode.next);
             list.add(listNode.val);
         }
         return list;
     }
}

P.S.不习惯用markdown…尤其是截图，需要保存，费劲