Java题解
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public int[] printListReversingly(ListNode head) {
int n = 0;
for(ListNode p = head; p != null; p = p.next){
n ++;
}
int[] a = new int[n];
for(ListNode p = head; p != null; p = p.next){
a[--n] = p.val;
}
return a;
}
}