剑指offer 06 从尾到头打印链表

输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

示例 1：

输入：head = [1,3,2]
输出：[2,3,1]

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] reversePrint(ListNode head) {
        ListNode node = head;
        int length = 0;
        while(head != null){
            length++;
            head = head.next;
        }
        int [] arr = new int[length];
        while(node != null){
            arr[--length] = node.val;
            node = node.next;
        }
        return arr;
//栈思路
        // LinkedList<Integer> stack = new LinkedList<Integer>();
        // while(head != null) {
        //     stack.addLast(head.val);
        //     head = head.next;
        // }
        // int[] res = new int[stack.size()];
        // for(int i = 0; i < res.length; i++)
        //     res[i] = stack.removeLast();
        // return res;
    }
}