题解 | #从尾到头打印链表#

没有unshift函数我还真不知道怎么半了 难道先保存在倒序输出？

/*function ListNode(x){
    this.val = x;
    this.next = null;
}*/
function printListFromTailToHead(head)
{
    // write code here
    let res=[]
    let pointer=head
    if (head===null) return []
    while(pointer.next!=null){
        res.unshift(pointer.val)
         pointer=pointer.next
    }
    res.unshift(pointer.val)
    return res
}
module.exports = {
    printListFromTailToHead : printListFromTailToHead
};