输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 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) {
if(head == null){
return new int[0];
}
ListNode root = head;
int length = 0;
while(root != null){
length++;
root = root.next;
}
int[] array = new int[length];
for(int i = 0;i < length;i++){
array[length - i - 1] = head.val;
head = head.next ;
}
return array;
}
}
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof