Sword finger offer question brushing record - offer 06 Print linked list from end to end

Enter the head node of a linked list , Return the value of each node from the end to the end （ Return with array ）.

Example 1：

 Input ：head = [1,3,2]
 Output ：[2,3,1]

Method 1： Stack , Reverse the linked list by putting it on the stack and putting it out of the stack

public class Sword_06 {
    public static void main(String[] args) {
        ListNode l1 = new ListNode(1);
        ListNode l2 = new ListNode(3);
        ListNode l3 = new ListNode(2);
        l1.next = l2;
        l2.next = l3;

        System.out.println(l1.val);
        Sword_06 s6 = new Sword_06();
        int[] ints = s6.reversePrint(l1);
        for (int i = 0;i < ints.length;i++){
            System.out.println(ints[i]);
        }
    }
    public int[] reversePrint(ListNode head) {
        Stack<ListNode> stack = new Stack<>();
        ListNode temp = head;

        while (temp != null){
            stack.push(temp);
            temp = temp.next;
        }
        int[] arr = new int[stack.size()];
        for (int i = 0;i < arr.length;i++){
            ListNode pop = stack.pop();
            arr[i] = pop.val;
        }

        return arr;
    }
}
class ListNode {
    int val;
    ListNode next;
    ListNode(int x) { val = x; }
  }

There is a little error in writing the stack loop , The cycle condition is written at the beginning stack.size(), Ignored after outbound size Reduced problems , So it's always wrong .

Time and space complexity is O(n);