首页 > 代码库 > CC150 2.3
CC150 2.3
2.3 Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node. EXAMPLE Input: the node ‘c’ from the linked list a->b->c->d->e Result: nothing is returned, but the new linked list looks like a->b->d->e
It seems cannot direclty delete the node.
But we can delete the data.
void delete(Node toDelete) { if (toDelete == null) return null; Node n = toDelete; while (n!= null) { if (n.next != null) { n.data = n.next.data; if (n.next.next == null) { n.next = null; } } n= n.next; } }
CC150 2.3
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。