当前位置：网站首页>Reverse linked list exercise

Reverse linked list exercise

2022-04-23 08:05:00 【Pen drawing Acacia】 

var reverseList = function(head) {
    //  Judge the variable boundary problem 
    if (!head || !head.next) return head
    //  The initial setting is empty , Because after the first node is reversed, it is the tail , The tail node points to  null
    let pre = null
    let current = head
    let next
    //  Determine whether the current node is empty 
    //  If it is not empty, get the next node of the current node first 
    //  And then put the  next  Set as previous node 
    //  And then put  current  Set as next node ,pre  Set as current node 
    while(current) {
        next = current.next
        current.next = pre
        pre = current
        current = next
    }
    return pre
};

版权声明
本文为[Pen drawing Acacia]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204230624332722.html

边栏推荐

猜你喜欢

随机推荐