单链表反转

package com.baichuan.javalib

fun main() {
    MyClass.printList()
    MyClass.reversal()
    MyClass.printList()
}

class MyClass {


    companion object {
        var mHeader: Node? = Node(0, Node(1, Node(2, Node(3, null))))
//        private lateinit var stringBuffer :StringBuffer
        fun printList(){
//            stringBuffer = StringBuffer()
//            var header = mHeader
//            while (null != header){
//                stringBuffer.append(header.num)
//                header = header.next
//            }
//            println(stringBuffer)
            println(mHeader)
        }
        fun reversal() {
            var pre: Node? = null //上一个
            var header: Node? = mHeader //
            var node: Node? = mHeader
            while (null != header) {
                node = header
                header = header.next
                node.next = pre
                pre = node
            }
            mHeader = node
        }
    }

}


data class Node(
    var num: Int,
    var next: Node?
)


输出：
Node(num=0, next=Node(num=1, next=Node(num=2, next=Node(num=3, next=null))))
Node(num=3, next=Node(num=2, next=Node(num=1, next=Node(num=0, next=null))))