剑指offer day2

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

/**
 * @param {ListNode} head
 * @return {number[]}
 */
var reversePrint = function(head) {
    let stack = [],cur = head;
    while(cur){
        stack.unshift(cur.val);
        if(cur){cur = cur.next;}
    }
    return stack;

};

不去想那些太模板化的算法理论还是挺简单的，遍历链表，每次都插入队头，最后返回队

2、反转链表：题目地址剑指 Offer 24. 反转链表

 

var reverseList = function(head) {
     if(head == null || head.next==null){return head;}
        let cur = head,prev = null; 
        while(cur){
           let temp = cur.next;
           cur.next = prev;
           prev = cur;
           cur = temp;
        }
        return prev;
 
 
};

思路：

3、