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