Print linked list from end to beginning

Title:
Enter the head node of a linked list, and return the value of each node from the end to the beginning (returned as an array)
Example 1:
Input: head= [1,3,2]
Output: [2,3,1]
Analysis:
Thinking about creating an array first, you need to determine how many numbers there are,After confirming, it can be loaded directly.

Code:

public class ReversePrint {public int[] reversePrint(ListNodehead) {if (head == null){return new int[0];}ListNode temp = head;int count = 0;//Calculate the length of the returned arraywhile (temp != null){count++;temp = temp.next;}int k = count - 1;int[] res = new int[count];//You can start assigning valueswhile (head !=null){res[k--] = head.val;head = head.next;}return res;}}