题目描述 评论 (894) 题解 (2.5k) 提交记录 剑指 Offer 06. 从尾到头打印链表

package leetcode;

import java.util.ArrayList;

public class offer_06 {
    public int[] reversePrint(ListNode head) {
        ArrayList<Integer> list=new ArrayList<Integer>();
        reverse(head, list);
        int[] arr=new int[list.size()];
        for(int i=0;i<list.size();i++) {
            arr[i]=list.get(i);
        }
        return arr;
    }
    public void reverse(ListNode node,ArrayList<Integer> list) {
        if(node!=null) {
            reverse(node.next,list);
            list.add(node.val);
        }
    }  
}