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 刪除連結串列的節點。