題目描述
JavaScript:
思路:
把鏈表存到數組中,然後通過數組的reverse()方法反轉數組中的元素
/*function ListNode(x){
this.val = x;
this.next = null;
}*/
function printListFromTailToHead(head)
{
var arr = [];
while(head != null) {
arr.push(head.val);
head = head.next;
}
return arr.reverse();
}