LeetCode106|从尾到头打印链表

示例 1：

输入：head = [1,3,2]
输出：[2,3,1]
 

限制：

0 <= 链表长度 <= 10000

import java.util.Stack;

public class ReversePrintTest {
    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;
        int[] reversePrint = reversePrint(l1);
        for (int num : reversePrint
        ) {
            System.out.print(num + "t");
        }

    }

    public static int[] reversePrint(ListNode head) {
        if (head == null) {
            return new int[0];
        }
        if (head.next == null) {
            return new int[]{head.val};
        }
        Stack<Integer> stack = new Stack<>();
        ListNode tempNode = head;
        while (tempNode != null) {
            stack.push(tempNode.val);
            tempNode = tempNode.next;
        }
        int[] result = new int[stack.size()];

        int index = 0;
        while (!stack.isEmpty()) {
            result[index] = stack.pop();
            index++;
        }
        return result;
    }
}