6_剑指offer_从尾到头打印链表

思路一：用一个辅助栈来实现

class Solution {
    public int[] reversePrint(ListNode head) {
        if (head == null) return new int[0];
        // 用一个辅助栈来实现
        Stack<Integer> stack = new Stack<>();
        stack.add(head.val);
        int total = 1;
        while (head.next != null) {
            stack.add(head.next.val);
            head = head.next;
            total++;
        }
        int[] res = new int[total];
        for (int i = 0; i < total; i++) {
            res[i] = stack.pop();
        }
        return res;
    }
}

思路二：先计数，然后再填充

class Solution {
    public int[] reversePrint(ListNode head) {
        int total = 0;
        ListNode tmp = head;
        while (tmp != null) {
            total++;
            tmp = tmp.next;
        }
        int[] res = new int[total];
        for (int i = total - 1; i >= 0; i--) {
            res[i] = head.val;
            head = head.next;
        }
        return res;
    }
}