【第三轮】6.23-6.29 CareerCup 2.3

【解题思路】empty/last node could not be deleted. copy the data from the next node to current node, and link current node to next.next node
【时间复杂度】O(1)
【空间复杂度】O(1)
【gist link】https://gist.github.com/bitcpf/943a20fc760f8ca4f6d3

【解题思路】
// Ask the interviewer if this means that the middlenode won't be the first or the last. If it is the first it doesn't matter. However if it is the last it can't be deleted. I assume the node that is to be deleted is not the last.

* Copy the value of each following node back one step, and put null after the 2nd to last node.
【时间复杂度】
O(n)
【空间复杂度】
O(1)
【gist link】
https://gist.github.com/XiaoxiaoLi/f4ebb8143890558ac5ff

做完才发现书里答案那么简单，智商啊。。。其实就是把n下一个node的data copy过来，然后直接删掉n.next即可。。。那样时间空间都是O（1）了吧

【解题思路】
Copy the following pointer content, and relink the next to the next next pointer
【时间复杂度】
O(1)
【空间复杂度】
O(1)
【gist link】
https://gist.github.com/habina/1effe686ec65dbadf1ec

补充内容 (2014-6-28 10:18):
@ivycheung1208 嗯，是的，谢谢提醒，我准备用python重写

【解题思路】
只是传入node，那么copy当前需要删除的node的下一个结点的数据到当前结点，然后当前结点连接下一个结点的next
【时间复杂度】
O(1)
【空间复杂度】
O(1)
【gist link】
https://gist.github.com/JoyceeLee/16128f844bfb476eb21c

【解题思路】Move the value of the next node to current node, remove next node. It's impossible if current node is the last node in the list.
【时间复杂度】O(1)
【空间复杂度】O(1)
【gist link】https://gist.github.com/nealhu/f5dcf011d595afa43278

【解题思路】Update the current node's value to the next node's value. Skip the next node.
【时间复杂度】O(1)
【空间复杂度】O(1)
【gist link】https://gist.github.com/jason51122/94802d43cf85c27ccd29

【解题思路】
  把next node的data给当前的node，再删除next node
【时间复杂度】
   O（1）
【空间复杂度】
   O(1)
【gist link】https://gist.github.com/yokiy/b5bbba6b2bdb36327a29

【解题思路】 copy  the data from the next node over to the current node, remove the next node
【时间复杂度】O(1)
【空间复杂度】O(1)
【gist link】https://gist.github.com/jyhjuzi/3cf87cd4799352c6e4d9

【解题思路】
***from solution***
copy data from the next node over, then delete the next node
(assume data type is integer)
【时间复杂度】
O(1)
【空间复杂度】
O(1)
【gist link】
https://gist.github.com/637c9366423ebd2ad8f0
【test case】
n = 0, list = {1, 2, 3, 4} invalid index
n = 1, list = {1, 2, 3, 4} delete the first element
n = 4, list = {1, 2, 3, 4} cannot delete the last element