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