原题
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
class Solution {//时间36.40% 空间84.43%public int[] reversePrint(ListNode head) {LinkedList<Integer> stack = new LinkedList<Integer>();while(head!=null){stack.push(head.val);head = head.next;}int size = stack.size();int[] arr = new int[size];for(int i = 0;i< size;i++){arr[i] = stack.pop();}return arr;}}