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

,

Recursion

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
    public int[] reversePrint(ListNode head) {
        List<Integer> list = new LinkedList<>();
        recur(list, head);

        int[] array = new int[list.size()];
        for (int i = 0; i < list.size(); i++) {
            array[i] = list.get(i);
        }
        return array;
    }

    private void recur(List<Integer> list, ListNode node) {
        if (node == null) {
            return;
        }

        recur(list, node.next);
        list.add(node.val);
    }
}

Linked List

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
    public int[] reversePrint(ListNode head) {
        Deque<Integer> deque = new LinkedList<>();
        ListNode node = head;
        while (node != null) {
            deque.addLast(node.val);
            node = node.next;
        }

        int[] array = new int[deque.size()];
        for (int i = 0; i < array.length; i++) {
            array[i] = deque.removeLast();
        }
        return array;
    }
}

References

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