Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node
with value 3, the linked list should become 1
-> 2 -> 4 after calling your function.
实现：
void deleteNode(ListNode* node) {
*node = *(node->next);
}
这应该是最短的代码了。
版权声明：本文为博主原创文章，未经博主允许不得转载。
LeetCode237——Delete Node in a Linked List
原文地址：http://blog.csdn.net/booirror/article/details/47293401
