题目描述:
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
代码描述:
/**
* 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> sta = new Stack();
ListNode temp = head;
while (temp!=null){
sta.push(temp.val);
temp = temp.next;
}
int[] arr = new int[sta.size()];
for(int i = 0; i < arr.length; i++){
arr[i] = sta.pop();
}
return arr;
}
}