Skip to content

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

输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。

示例 1:

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

限制:

0 <= 链表长度 <= 10000

js
/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode} head
 * @return {number[]}
 */
var reversePrint = function (head) {
    if (Object.is(head, null)) {
        return [];
    }

    if (head.next === null) {
        return [head.val];
    }

    return reversePrint(head.next).concat(head.val);
};
/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode} head
 * @return {number[]}
 */
var reversePrint = function (head) {
    if (Object.is(head, null)) {
        return [];
    }

    if (head.next === null) {
        return [head.val];
    }

    return reversePrint(head.next).concat(head.val);
};

Released under the MIT License.