剑指Offer 06.从头到尾打印链表
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
public int[] reversePrint(ListNode head){
ListNode pointer = head;
int length = 0;
while(pointer != null){
length++;
pointer = pointer.next;
}
int[] list = new int[length];
pointer = head;
for(int i = length-1; i >= 0; i--){
list[i] = pointer.val;
pointer = pointer.next;
}
return list;
}