剑指 Offer 06. 从尾到头打印链表

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

示例1

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

限制：

0 <= 链表长度 <= 10000

/**
 * 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 count = 0;
        while (node != null){
            ++count;
            node = node.next;
        }
        int [] nums = new int[count];
        node = head;
        for(int i = count -1 ;i>=0 ;--i){
            nums[i] = node.val;
            node = node.next;
        }
        return nums;
    }
}

js

var reversePrint = function(head) {
    let nums=[];
    let node =head;
    while(node!==null){
        nums.unshift(node.val);
        node =node.next;
    }
    return nums;
};