题解 | #从尾到头打印链表#
从尾到头打印链表
https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035
1、使用递归的回溯特性解决
/*function ListNode(x){
this.val = x;
this.next = null;
}*/
const recursion = (node, res) => {
if (node) {
recursion(node.next, res);
res.push(node.val);
}
}
function printListFromTailToHead(head)
{
const res = [];
recursion(head, res);
return res;
}
module.exports = {
printListFromTailToHead : printListFromTailToHead
};
2、使用unshift
