剑指office_06.从尾到头打印链表

 题解1：使用unshift的方式，将链表从头到尾的插入到数组中

var reversePrint = function(head) {
    const array = [];
    while (head) {
        array.unshift(head.val);
        head = head.next;
    }
    return array;
};

题解2：递归

var reversePrint = function(head) {
    let nums = []
    const visitor = function (head) {
        if (head !== null) {
            visitor(head.next)
            nums.push(head.val)
        }
    };
    visitor(head)
    return nums
};