/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] printListReversingly(ListNode head) {
        Stack<Integer> stack = new Stack<>();
        while(head != null) {
            stack.add(head.val);
            head = head.next;
        }

        List<Integer> list = new ArrayList<>();
        while(!stack.isEmpty()) {
            list.add(stack.pop());
        }

        return list.stream().mapToInt(Integer::intValue).toArray();
    }
}