LeetCode_1649_从尾到头打印链表

题目链接

• https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/

解题思路

• 首先生成一个ArrayList
• 访问单链表，每次将值添加到ArrayList中
• 初始化一个int数组，大小为ArrayList.size
• 将ArrayList中的数据存入Int数组中

AC代码

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