【解题思路】
将链表的值放入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<Integer>();
ListNode p = head;
while(p != null)
{
list.add(p.val);
p = p.next;
}
int[] ans = list.stream().filter(Integer -> Integer!=null).mapToInt(i->i).toArray();
for(int i = 0; i < ans.length/2; i++)
{
int tmp = ans[i];
ans[i] = ans[ans.length-i-1];
ans[ans.length-i-1] = tmp;
}
return ans;
}
}