输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 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) {
// //栈 先进后出
// Stack<Integer> st = new Stack<>();
// while(head != null) {
// st.push(head.val);
// head = head.next;
// }
// int[] res = new int[st.size()];
// int count = 0;
// while(!st.isEmpty()) {
// res[count++] = stack.pop();
// }
// return res;
//不使用栈 倒序输出
ListNode node = head;
int count = 0;
while(node != null) {
++count;
node = node.next;
}
int[] nums = new int[count];
node = head;
for(int i = count-1; i>=0;i--){
nums[i] = node.val;
node = node.next;
}
return nums;
}
}