js链表算法

js链表

// 链表

function Node(value) {
    this.value = value;
    this.next = null
}

var node1 = new Node(1)
var node2 = new Node(2)
var node3 = new Node(3)
var node4 = new Node(4)
var node5 = new Node(5)

node1.next = node2
node2.next = node3
node3.next = node4
node4.next = node5

/*
// 简单输出

console.log(node1.value)
console.log(node1.next.value)
*/

// 最优输出
function bianlink(root) {
    var temp = root
    while (true) {
        if (temp !== null) {
            console.log(temp.value)
        } else {
            break;
        }
        temp = temp.next
    }
}
bianlink(node1)

// 递归算法
function bianlink(root) {
    if (root === null) return
    console.log(root.value)
    bianlink(root.next)
}

bianlink(node1)

// 链表逆置
function inversion(root) {
    if (root.next.next === null) {
        root.next.next = root
        return root
    } else {
        var result = inversion(root.next)
        root.next.next = root;
        root.next = null;
        return result
    }
}
inversion(node1)
console.log('node5',node5)