@cxm-2016
2016-12-25T14:57:24.000000Z
字数 304
阅读 2628
算法
版本:1
作者:陈小默
思路:通过两个指针实现
fun <T> delete(node: Node<T>, value: T): Node<T>? {var head: Node<T>? = nodewhile (head != null) {if (head.value != value) breakhead = head.next}if (head == null) return nullvar pre = headvar cur = pre.nextwhile (cur != null) {if (cur.value == value)pre!!.next = cur.nextelsepre = curcur = cur.next}return head}
