输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] reversePrint(ListNode head) {
Stack<Integer> Stack=new Stack<>();
while(head!=null)
{
Stack.push(head.val);
head=head.next;
}
int[] a= new int[Stack.size()];
int i=0;
while(!Stack.isEmpty()){
a[i]=Stack.pop();
++i;
}
return a;
}
}