剑指 Offer 06. 从尾到头打印链表

题目入口:从尾到头打印链表https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/用一个ArrayList存一下链表正序遍历后的元素,再将ArrayList的元素倒序取出并放到int数组里面.

class Solution {
    public int[] reversePrint(ListNode head) {
        ArrayList<Integer> list = new ArrayList<Integer>();
        while(head != null){
            list.add(head.val);
            head = head.next;
        }
        int len = list.size();
        int[] result = new int[len];
        for(int i = 0;i < len; i++){
            result[i] = list.get(len - i - 1);
        }
        return result;
    }
}