题目:输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:输入:head = [1,3,2]
输出:[2,3,1]
限制:0 <= 链表长度 <= 10000
思路:反向填充数组
/**
* 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 temp = head;
int count = 0;
while(temp != null){
count++;
temp = temp.next;
}
int[] result = new int[count];
temp = head;
for(int i = count-1 ; i >= 0 ; i--){
result[i] = temp.val;
temp = temp.next;
}
return result;
}
}