Delete a node in the middle of a one-way linked list. Suppose you can only access this node.

1/* 2 * in this case, you cannot access the first node of the linked list. You can only access the node to be deleted, in fact, we can think 3 * like this: copy the value of the successor node to the current node, the next address of the current node points to the next address of the next node 4 * The Problem of deleting the current node is converted to the problem of deleting the next node 5 * Note the following here, if the end node of the linked list is to be deleted, this problem cannot be solved 6 **/7 public static Boolean deletenode (node) 8 {9 If (node = NULL | node. next = NULL) 10 return false; 11 node n = node. next; 12 node. data = n. data; 13 node. next = n. next; 14 return true; 15}

 

Delete a node in the middle of a one-way linked list. Suppose you can only access this node.