单链表逆转

小禄不迷路

已于 2024-04-10 11:53:25 修改

阅读量148

点赞数 2

CC 4.0 BY-SA版权

文章标签：链表

于 2024-04-09 10:33:22 首次发布

本文链接：https://blog.youkuaiyun.com/qq_29425101/article/details/137540004

文章详细介绍了如何在JavaScript中使用classNode创建链表，包括构造函数、打印链表的方法，以及通过迭代和递归实现链表反转的操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class Node {
  constructor(val, next) {
    this.val = val;
    this.next = next;
  }
  print() {
    let head = this;
    let str = "";
    while (head) {
      str += head.val;
      head.next && (str += " => ");
      head = head.next;
    }
    console.log(str);
  }
}

let node5 = new Node(5, null);
let node4 = new Node(4, node5);
let node3 = new Node(3, node4);
let node2 = new Node(2, node3);
let node1 = new Node(1, node2);
node1.print();

//迭代
function reverse(node) {
  let pre = null,
    next;
  let cur = node;
  while (cur) {
    next = cur.next;
    cur.next = pre;
    pre = cur;
    cur = next;
  }
  return pre;
}

let newNode = reverse(node1);
newNode.print();

//递归调用
function reverse1(node) {
  if (!node || !node.next) {
    return node;
  }
  let newHead = reverse1(node);
  node.next.next = node;
  node.next = null;
  return newHead;
}

let newNode1 = reverse(node1);
newNode1.print();