简单实现链表反转

实现

// 定义链表
let node1 = {
  value: 1,
  next: node2 = {
    value: 2,
    next: node3 = {
      value: 3,
      next: node4 = {
        value: 4,
        next: null
      }
    }
  }
}
// 打印链表
function traverseLink(node){
  if (node === null) {
    return;
  }
  console.log(node.value);
  traverseLink(node.next)
}
traverseLink(node1)

console.log('****************');

// 反转链表
function reverseLink(head) {
  if (head === null || head.next === null) return;
  let p1 = head.next
  let p2 = p1.next
  head.next = null
  p1.next = head;
  head = p1

  while (p2 !== null) {
    p1 = p2
    p2 = p2.next
    p1.next = head;
    head = p1
  }
  return head
}

node1 = reverseLink(node1)
traverseLink(node1)