题解 | #数组中重复的数字#

递归，dfs

*    public class ListNode {
*        int val;
*        ListNode next = null;
*
*        ListNode(int val) {
*            this.val = val;
*        }
*    }
*
*/
import java.util.ArrayList;
public class Solution {
    public void dfs(ArrayList<Integer>ans,ListNode listnode){
        if(listnode==null) return ;
        dfs(ans,listnode.next);
        ans.add(listnode.val);
    }
    public ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
        ArrayList<Integer>ans=new ArrayList<>();
        dfs(ans,listNode);
        return ans;
    }
}