# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        end=[]
        while head:
            end.append(head.val)
            head=head.next
        return end[::-1]

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int[] ReversePrint(ListNode head) {
        List<int> ans = new List<int>();
        while(head!=null){
            ans.Add(head.val);
            head = head.next;
        }
        ans.Reverse();
        return ans.ToArray();
    }
}