剑指 Offer 06. 从尾到头打印链表
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入: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) {
let cur = head;
let temp = [];
let res=[];
let counter = 0;
while(cur){
temp.push(cur.val);
counter++;
cur = cur.next;
}
// return temp.reverse();
for(let i =0;i<counter;i++){
res.push(temp.pop());
}
return res;
};
源自于 剑指 Offer