输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 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 node = head;
int len = size(head);
int[] array = new int[len];
for (int i = array.length - 1;i >= 0;i--){
array[i] = node.val;
node = node.next;
}
return array;
}
// 得到链表长度
public int size(ListNode head){
int len = 0;
for (ListNode node = head;node != null;node = node.next) {
len++;
}
return len;
}
}