Java代码

class Solution {
    public int[] printListReversingly(ListNode head) {
        ListNode newHead = new ListNode(-1);
        ListNode tmpNode = head;
//        tmpNode = head;
        int count = 0;
        while(head!=null){
            head = head.next;
            tmpNode.next = newHead.next;
            newHead.next = tmpNode;
            tmpNode = head;
//            head = head.next;
            count = count + 1;
        }
        int[] resultArray = new int[count];
        int i = 0;
        newHead = newHead.next;
        while(newHead!=null){
            resultArray[i++] = newHead.val;
            //System.out.println(newHead.val);
            newHead = newHead.next;
        }
        return resultArray;

    }

}