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

public int[] reversePrint(ListNode head) {
        ArrayList<Integer> list = new ArrayList<>();
        while(head != null){
            list.add(0,head.val);
            head = head.next;
        }
        return list.stream().mapToInt(Integer::valueOf).toArray();
    }

public int[] reversePrint(ListNode head) {
        int count = 0;
        ListNode node = head;
        while(node != null){
            count++;
            node = node.next;
        }
        int[] nums = new int[count];
        for(int i = count-1;i>=0;i--){
            nums[i] = head.val;
            head = head.next;
        }
        
        return nums;
    }