Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node.
思路：复制后面节点的值，然后删除后面的节点。
注意：如果给定的节点是最后一个，则无解。。
public static boolean deleteNode(LinkedListNode n) { if (n == null || n.next == null) { return false; // Failure } LinkedListNode next = n.next; n.data = next.data; n.next = next.next; return true; }
Cracking the Coding Interview Q2.3,布布扣,bubuko.com
Cracking the Coding Interview Q2.3
原文：http://www.cnblogs.com/jdflyfly/p/3830656.html