算法2
java 代码
class Solution {
public int[] printListReversingly(ListNode head) {
if(head==null){
int[] a=new int[0];
return a;
}
ListNode t=head,x=head;
int ans=0;
while (t.next!=null){
ans++;
t=t.next;
}
ans++;
int[] a1=new int[ans];
while (ans-->0){
a1[ans]=x.val;
x=x.next;
}
return a1;
}
}