从尾到头打印链表
题目: 输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
解题思路: 很好想的一道题, 用LinkedList的addFirst解决计即可
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] reversePrint(ListNode head) {
LinkedList<Integer> ans = new LinkedList();
ListNode cur = head;
while(cur != null) {
ans.addFirst(cur.val);
cur = cur.next;
}
Object objs[] = ans.toArray();
int arr[] = new int[objs.length];
for(int i = 0; i < objs.length; i++){
arr[i] = (int)objs[i];
}
return arr;
}
}