2.3 Implement an algorithm to delete a node in the middle of a singly 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
LeetCode上的原题，请参考我之前的博客Delete Node in a Linked List 删除链表的节点。
本文转自博客园Grandyang的博客，原文链接：删除链表的节点[CareerCup] 2.3 Delete Node in a Linked List ，如需转载请自行联系原博主。
