线性数据结构-链表的逆置

视黑梦白

于 2024-06-05 17:35:12 发布

阅读量138

点赞数 3

CC 4.0 BY-SA版权

分类专栏：数据结构与算法文章标签：数据结构链表前端

本文链接：https://blog.csdn.net/passworddddddd/article/details/139472131

数据结构与算法专栏收录该内容

10 篇文章

订阅专栏

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

const node1 = new Node(1)
const node2 = new Node(2)
const node3 = new Node(3)
const node4 = new Node(4)
const node5 = new Node(5)
node1.next = node2
node2.next = node3
node3.next = node4
node4.next = node5

function bianli(node){
    if (node === null) return
    console.log(node.value)
    bianli(node.next)
}

function nizhi (root) {
	if (root === null || root.next === null) { 
		return root
    }
    const last = nizhi(root.next)
    root.next.next = root
    root.next = null
    return last
}

bianli(nizhi(node1))