题目
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
解题思路
- 遍历链表保存到list中
- 遍历list,逆序保存到数组中
代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] reversePrint(ListNode head) {
List<Integer> list = new ArrayList<>();
while (head != null) {
list.add(head.val);
head = head.next;
}
int[] ans = new int[list.size()];
for (int i = 0; i < list.size(); i++) ans[list.size() - 1 - i] = list.get(i);
return ans;
}
}