从尾到头打印链表

题目

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

示例

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

输出: [2, 3, 1]

题解

遍历链表, 通过栈存储到数组即可.

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

  while (head) {
    arr.unshift(head.val)
    head = head.next
  }

  return arr
}