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

题目

解题

解题一：递归

// javascript
var reversePrint = function(head) {
    if (head === null) return [];
    const res = reversePrint(head.next);
    res.push(head.val);
    return res;
};

解题二：栈

递归其实是隐式地调用栈，两者效率一样。

// javascript
var reversePrint = function(head) {
    const stack = [];
    while (head !== null) {
        stack.push(head.val);
        head = head.next;
    }
    const n = stack.length;
    const res = new Array(n);
    for (let i = 0; i < n; ++i) {
        res[i] = stack.pop();
    }
    return res;
};