[第二轮] 2/25-3/3 CareerCup 2.3

https://github.com/quantumrose/C ... 2.3.DeleteNode.java

Fanyare 发表于 2013-2-27 02:01
https://github.com/quantumrose/CareerCup/blob/master/2.3.DeleteNode.java

yes, and I can't figure out the bug...> <

Fanyare 发表于 2013-2-27 02:01
https://github.com/quantumrose/CareerCup/blob/master/2.3.DeleteNode.java

I see. I used to write the "delNode = NULL;", but it doesn't work..

Use three pointers to travel through the list such that when the most prior pointer reaches the tail, the middle pointer points to middle node, followed by the last pointer for deleting the middle.
Don't know how to handle the scenario with even nodes.
https://github.com/moophis/careercup/blob/master/2.2-3.cpp

gist：https://gist.github.com/sing1ee/5046778

(1)delete the last node
(2)delete others 1)copy the next value to current, 2) point current next to next's next;

Copy work from  mazl123321

https://gist.github.com/lazyGoose/5049552

* Solution: copy the next node information to the given node and delete the next node.
* Time complexity: O(1)
这种方法的局限性在于不能删除最后一个node， 不知道大家有没有别的好的想法。
c/c++实现
https://github.com/StanleyLee/CareerCup/blob/master/2_3.cpp

把current node的next node的data copy给当前node.

https://gist.github.com/skxie/17d581ead6baab65a4fd

champoier 发表于 2013-2-28 15:08
把current node的next node的data copy给当前node.

https://gist.github.com/skxie/17d581ead6baab65a4f ...

Can not delete the last node.

We can delete the last node withe two pointers and one iteration and the average cost is O(1)

replace node C content with node D, then delete node D(Put C's next node is E)