更新单链表第N个节点

[unliar]

单链表的遍历

const update = (node, n, val) => {
    let cur = 0;
    let temp = node;
    // 遍历节点
    while (cur < n) {
        cur++;
        temp = temp.next;
    }
   // 
    temp.val = val;
};