题目

https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/

思路

递归，归阶段push

解题

  2. /**
  3.  * Definition for singly-linked list.
  4.  * function ListNode(val) {
  5.  *     this.val = val;
  6.  *     this.next = null;
  7.  * }
  8.  */
  9. /**
  10.  * @param {ListNode} head
  11.  * @return {number[]}
  12.  */
  14. // 递归或者栈
  15. var reversePrint = function(head) {
  16.     const result = []
  17.     const reverse = (head, result) => {
  19.         if (!head) {
  20.             return
  21.         }
  22.         const prev = head
  23.         head = head.next
  24.         reverse(head, result)
  25.         result.push(prev.val)
  26.     }
  27.     reverse(head, result)
  29.     return result
  30. };